Abstract
We develop a formal framework to give computer programs an abstract interpretation as information transformers. Then the quantitative relation between input and output information is investigated. Our theory is based oninformation domains, a refinement of the classical domains used in denotational semantics, and on the theory of abstract interpretation of functional languages.
Similar content being viewed by others
References
Abramsky, S. and Hankin, C. (eds):Abstract Interpretation of Declarative Languages, Computers and Their Applications, Ellis Horwood, 1987.
Baumann, P.: Information Domains. Technical Report 89.10, Institut für Informatik der Universität Zürich, December 1989.
Burn, G. L.: Deriving a Parallel Evaluation Model for Lazy Functional Languages Using Abstract Interpretation. In:Parallel Computing, pp. 111–166. John Wiley & Sons, 1989.
Curien, P. L.:Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman, London, 1986.
Denning, P. J., Comer, D. E., Gries, D. et al.: Computing as a Discipline.CACM,32(1), 9–23 (1989).
Kahn, G. and Plotkin, G. D.: Domaines concrets. Rapport de Recherche 336, IRIA, December 1978.
Milner, R.: Fully Abstract Models of Typed λ-calculi.TCS,4(1), 1–22 (1977).
Scarrott, G. G.: The Nature of Information.The Computer Journal,32(3), 262–266 (1989).
Scott, D. S.: Lectures on a Mathematical Theory of Computation. Technical Monograph PRG-19, Oxford University Computing Laboratory, May 1981.
Scott, D. S.: Domains for Denotational Semantics. In:9th ICALP: Automata, Languages and Programming, pp. 577–613, LNCS 140, Springer-Verlag, 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baumann, P. Towards a semantics-based information theory. Formal Aspects of Computing 3, 315–325 (1991). https://doi.org/10.1007/BF01642506
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01642506