Skip to main content
SpringerLink
Log in

A complete and decidable proof system for call-by-value equalities

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 443))

Included in the following conference series:

Abstract

We develop a logic for proving call-by-value observational congruences between pure simply-typed λ-terms. The logic is complete for proving equations in a standard call-by-value model, settling an open question of [10]. By the full abstraction theorem of [20, 22], the logic proves all call-by-value observational congruences between pure terms. Finally, we show that the equations true in the standard model are decidable.

Preliminary Report

Supported by an NSF Graduate Fellowship, NSF Grant Nos. 8511190-DCR and 8819761-CCR, ONR Grant No. N00014-83-K-0125, and DARPA Contract No. N00014-89-J-1988.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harold Abelson and Gerald Jay Sussman. Structure and Interpretation of Computer Programs. MIT Press and McGraw-Hill, 1985.

    Google Scholar 

  2. Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland, 1981. Revised Edition, 1984.

    Google Scholar 

  3. Stavros S. Cosmadakis, Albert R. Meyer, and Jon G. Riecke. Completeness for typed lazy inequalities (preliminary report). In 5th Symp. Logic in Computer Science. IEEE, 1990. To appear.

    Google Scholar 

  4. P.-L. Curien and A. Obtułowicz. Partiality, cartesian closedness, and toposes. Information and Control, 80:50–95, 1989.

    Google Scholar 

  5. Herbert B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

    Google Scholar 

  6. Harvey Friedman. Equality between functionals. In Rohit Parikh, editor, Logic Colloquium '73, volume 453 of Lect. Notes in Math., pages 22–37. Springer-Verlag, 1975.

    Google Scholar 

  7. Albert R. Meyer. What is a model of the lambda calculus? Information and Control, 52:87–122, 1982.

    Google Scholar 

  8. Robin Milner. A proposal for Standard ML. Polymorphism, 1(3), December 1983.

    Google Scholar 

  9. Eugenio Moggi. Categories of partial morphisms and the λ p -calculus. In Proceedings of Workshop on Category Theory and Computer Programming, Guildford, 1985, volume 240 of Lect. Notes in Computer Sci., New York, 1986. Springer-Verlag.

    Google Scholar 

  10. Eugenio Moggi. The Partial Lambda Calculus. PhD thesis, University of Edinburgh, 1988.

    Google Scholar 

  11. Gordon D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Sci., 1:125–159, 1975.

    Google Scholar 

  12. Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Sci., 5:223–257, 1977.

    Google Scholar 

  13. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., Computer Science Dept., Denmark, 1981.

    Google Scholar 

  14. Gordon D. Plotkin. Notes on completeness of the full continuous type hierarchy. Unpublished manuscript, MIT, November 1982.

    Google Scholar 

  15. Gordon D. Plotkin. (Towards a) logic for computable functions. Unpublished manuscript, CSLI Summer School Notes, 1985.

    Google Scholar 

  16. G. Rosolini. Continuity and Effectiveness in Topoi. PhD thesis, Oxford University, 1986.

    Google Scholar 

  17. V.Yu. Sazonov. Expressibility of functions in D. Scott's LCF language. Algebra i Logika, 15:308–330, 1976. (Russian).

    Google Scholar 

  18. Dana Scott. A type theoretical alternative to CUCH, ISWIM, OWHY. Oxford University, unpublished manuscript, 1969.

    Google Scholar 

  19. Dana Scott. Data types as lattices. SIAM J. Computing, 5:522–587, 1976.

    Google Scholar 

  20. Kurt Sieber. Message to the types@theory.lcs.mit.edu electronic mail forum, June 1989.

    Google Scholar 

  21. Kurt Sieber. Personal communication, January 1990.

    Google Scholar 

  22. Dorai Sitaram and Matthias Felleisen. Reasoning with continuations II: Full abstraction for models of control. In Proc. Conf. LISP and Functional Programming. ACM, 1990. To appear.

    Google Scholar 

  23. Richard Statman. Equality between functionals revisited. In L.A. Harrington, et al., editor, Harvey Friedman's Research on the Foundations of Mathematics, volume 117 of Studies in Logic, pages 331–338. North-Holland, 1985.

    Google Scholar 

  24. Richard Statman. Logical relations in the typed λ-calculus. Information and Control, 65:86–97, 1985.

    Google Scholar 

  25. Guy L. Steele. Common Lisp: The Language. Digital Press, Bedford, MA, 1984.

    Google Scholar 

  26. Christopher P. Wadsworth. The relation between computational and denotational properties for Scott's D∞ models. SIAM J. Computing, 5(3):488–521, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT Laboratory for Computer Science, USA

    Jon G. Riecke

Authors
  1. Jon G. Riecke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riecke, J.G. (1990). A complete and decidable proof system for call-by-value equalities. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032019

Download citation

  • DOI: https://doi.org/10.1007/BFb0032019

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation