Joseph Y. Halpern
Albert R. Meyer
ABSTRACT
Denotational semantics for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing) is given by translating programs into an appropriately typed λ-calculus. Procedures are entirely explained at a purely functional level - independent of the interpretation of program constructs - by continuous models for λ-calculus. However, the usual (cpo) models are not adequate to model local storage allocation for blocks because storage overflow presents an apparent discontinuity. New domains of store models are offered to solve this problem.
- 1.H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic 103, North Holland, 1981.Google Scholar
- 2.B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science25, 1983, 95-170.Google Scholar
- 3.W. Damm, The IO- and OI-hierarchies, Theoretical Computer Science20, 1982, 95-207.Google Scholar
- 4.W. Damm and E. Fehr, A schematological approach to the procedure concept of ALGOL-like languages, Proc. 5ieme colloque sur les arbres en algebre et en programmation, Lille, 1980, 130-134.Google Scholar
- 5.J. De Bakker, Mathematical Theory of Program Correctness, Prentice-Hall International, 1980, 505pp. Google ScholarDigital Library
- 6.J. H. Gallier, n-Rational algebras, Parts I and II, Technical Report, Dept. of Computer and Information Sciences, Univ. of Pennsylvania, Philadelphia, 1983, 55pp. and 65pp.Google Scholar
- 7.M. J. C. Gordon, The Denotational Description of Programming Languages, Springer, 1979. Google ScholarDigital Library
- 8.I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science 99, Springer, 1981, 158pp. Google ScholarDigital Library
- 9.I. Guessarian, Survey on some classes of interpretations and some their applications, Laboratoire Informatique Theorique et Programmation, 82-46, Univ. Paris 7, 1982.Google Scholar
- 10.J. Y. Halpern, A good Hoare axiom system for an ALGOL-like language, ACM Symp. on Principles of Programming Languages, 1983 (this volume). Google ScholarDigital Library
- 11.R. Hindley, B. Lercher, and J. Seldin, Introduction to Combinatory Logic, London Math. Soc. Lecture Note Series 7, Cambridge University Press, 1972.Google Scholar
- 12.J. Lambek, From &lgr;-calculus to Cartesian closed categories, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley, eds., Academic Press, 1980, 375-402.Google Scholar
- 13.P. J. Landin, A correspondence between ALGOL 60 and Church's lambda notation, Comm. ACM8, 1965, 89-101 and 158-165. Google ScholarDigital Library
- 14.H. Langmaack and E. R. Olderog, Present-day Hoare-like systems, 7thInt'l. Coll. Automata, Languages, and Programming, Lecture Notes in Computer Science 85, Springer, 1980, 363-373. Google ScholarDigital Library
- 15.J. Meseguer, Completions, factorizations and colimits of &ohgr;-posets, Coll. Math. Soc. Janos Bolyai 26. Math. Logic in Computer Science, Salgotarjan, Hungary, 1978, 509-545.Google Scholar
- 16.A. R. Meyer, What is a model of the &lgr;-calculus? Information and Control52, 1982, 87-122.Google Scholar
- 17.R. E. Milne and C. Strachey, A Theory of Programming Language Semantics, 2 Vols., Chapman and Hall, 1976. Google ScholarDigital Library
- 18.P. Naur et al., Revised report on the algorithmic language ALGOL 60, Computer J. 5, 1963, 349-367.Google ScholarCross Ref
- 19.M. Nivat, On the interpretation of recursive polyadic program schemes, Symposia Mathematica, 15, Academic Press, 1975, 255-281.Google Scholar
- 20.E. R. Olderog, Sound and complete Hoare-like calculi based on copy rules, Acta Informatica16, 1981, 161-197.Google Scholar
- 21.F. J. Oles, Type algebras, functor categories, and block structure, Computer Science Dept, Aarhus Univ. DAIMI PB-156, Denmark, Jan. 1983.Google Scholar
- 22.G. D. Plotkin, A powerdomain construction, SIAM J. Comp. 5, 1976, 452-487, 1976.Google ScholarCross Ref
- 23.G. D. Plotkin, Lambda-definability in the full type hierarchy, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley, eds., Academic Press, 1980, 363-373.Google Scholar
- 24.G. D. Plotkin, A Powerdomain for countable non-determinism, 9th Int'l. Coll. Automata, Languages, and Programming, Lecture Notes in Computer Science 140, Springer, 1982, 412-428. Google ScholarDigital Library
- 25.J. C. Reynolds, The essence of ALGOL, International Symposium on Algorithmic Languages, de Bakker and van Vliet, eds., North Holland, 1981a, 345-372.Google Scholar
- 26.J. C. Reynolds, The Craft of Programming, Prentice Hall International Series in Computer Science, 1981b, 434pp. Google ScholarDigital Library
- 27.J. C. Reynolds, Idealized ALGOL and its specification logic, Syracuse University, Technical Report 1-81, 1981c.Google Scholar
- 28.D. S. Scott, Lectures on a Mathematical Theory of Computation, Technical Monograph PRG-19, Oxford Univ. Computing Lab., 1981.Google Scholar
- 29.D. S. Scott, Domains for Denotational Semantics, 9th Int'l. Conf. Automata, Languages, and Programming, Lecture Notes in Computer Science 140, Springer, 1982, 577-613; to appear, Information and Control. Google ScholarDigital Library
- 30.M. B. Smyth, Powerdomains, J. Computer and System Sciences16, 1978, 23-36.Google Scholar
- 31.R. Statman, Logical relations and the typed lambda-calculus, to appear, 1982.Google Scholar
- 32.J. E. Stoy, Denotational Semantics: The Scott. Strachey Approach to Programming Language Theory, MIT Press, Cambridge, Massachusetts, 1977. Google ScholarDigital Library
- 33.R. D. Tennent, Principles of Programming Languages, Prentice-Hall International Series, 1981, 271pp. Google ScholarDigital Library
- 34.B. A. Trakhtenbrot, J. Y. Halpern, and A. R. Meyer, From denotational to operational and axiomatic semantics: an overview: Proc. Logics of Programs, Carnegie-Mellon Univ., Pittsburgh, 1983, to appear, Lecture Notes in Computer Science, D. Kozen and E. Clarke, eds., Springer, 1983. Google ScholarDigital Library
Index Terms
- The semantics of local storage, or what makes the free-list free?(Preliminary Report)
Recommendations
What if mass storage were free?
This paper investigates how database systems would be designed and used under the limiting-case assumption that mass storage is free. It is argued that free mass storage would free database systems from the limitations and problems caused by ...
Write once, get 50% free: saving SSD erase costs using WOM codes
FAST'15: Proceedings of the 13th USENIX Conference on File and Storage TechnologiesNAND flash, used in modern SSDs, is a write-once medium, where each memory cell must be erased prior to writing. The lifetime of an SSD is limited by the number of erasures allowed on each cell. Thus, minimizing erasures is a key objective in SSD ...
Optimizing Local File Accesses for FUSE-Based Distributed Storage
SCC '12: Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and AnalysisModern distributed file systems can store huge amounts of information while retaining the benefits of high reliability and performance. Many of these systems are prototyped with FUSE, a popular framework for implementing user-level file systems. ...
Comments