Skip to main content
SpringerLink
Log in

A theory of classes for a functional language with effects

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1992)

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

Included in the following conference series:

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. M. Abadi, B. Pierce, and G. Plotkin. Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science, 2(1):1–21, 1991.

    Google Scholar 

  2. S. Feferman. A language and axioms for explicit mathematics. In Algebra and Logic, volume 450 of Springer Lecture Notes in Mathematics, pages 87–139. Springer Verlag, 1975.

    Google Scholar 

  3. S. Feferman. A theory of variable types. Revista Colombiana de Matématicas, 19:95–105, 1985.

    Google Scholar 

  4. S. Feferman. Polymorphic typed lambda-calculi in a type-free axiomatic framework. In Logic and Computation, volume 106 of Contemporary Mathematics, pages 101–136. A.M.S., Providence R. I., 1990.

    Google Scholar 

  5. M. Felleisen. The Calculi of Lambda-v-cs Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Indiana University, 1987.

    Google Scholar 

  6. M. Felleisen and A. K. Wright. A syntactic approach to type soundness. Technical Report Rice COMP TR91-160, Rice University Computer Science Department, 1991.

    Google Scholar 

  7. J.Y. Halpern, A. R. Meyer, and B. A. Trakhtenbrot. The semantics of local storage, or what makes the free-list free? In 11th ACM Symposium on Principles of Programming Languages, pages 245–257, 1983.

    Google Scholar 

  8. J.Y. Halpern, A. R. Meyer, and B. A. Trakhtenbrot. From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview. In E. Clarke and D. Kozen, editors, Logics of Programs, Proceedings 1983, volume 164 of Lecture Notes in Computer Science. Springer, Berlin, 1984.

    Google Scholar 

  9. X. Leroy and P. Wies. Polymorphic type inference and assignment. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages, pages 291–302. ACM, 1990.

    Google Scholar 

  10. J. M. Lucassen. Types and Effects, towards the integration of functional and imperative programming. PhD thesis, MIT, 1987. Also available as LCS TR-408.

    Google Scholar 

  11. J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In 16th annual ACM Symposium on Principles of Programming Languages, pages 47–57, 1988.

    Google Scholar 

  12. Z. Manna and R Waldinger. Problematic features of programming languages. Acta Informatica, 16:371–426, 1981.

    Google Scholar 

  13. I. A. Mason and C. L. Talcott. Axiomatizing operational equivalence in the presence of side effects. In Fourth Annual Symposium on Logic in Computer Science. IEEE, 1989.

    Google Scholar 

  14. I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1:287–327, 1991.

    Google Scholar 

  15. I. A. Mason and C. L. Talcott. Inferring the equivalence of functional programs that mutate data. Theoretical Computer Science, 105(2):167–215, 1992.

    Google Scholar 

  16. I. A. Mason and C. L. Talcott. References, local variables and operational reasoning. In Seventh Annual Symposium on Logic in Computer Science, pages 186–197. IEEE, 1992.

    Google Scholar 

  17. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: Preliminary report. In 15th ACM Symposium on Principles of Programming Languages, pages 191–208, 1988.

    Google Scholar 

  18. E. Moggi. Computational lambda-calculus and monads. In Fourth Annual Symposium on Logic in Computer Science. IEEE, 1989.

    Google Scholar 

  19. J. H. Morris. Lambda calculus models of programming languages. PhD thesis, Massachusetts Institute of Technology, 1968.

    Google Scholar 

  20. P.W. O'Hearn and R.D. Tennent. Semantic Analysis of Specification Logic, Part 2. Information and Computation, ?:?-?, 199?

    Google Scholar 

  21. P.W. O'Hearn and R.D. Tennent. Semantics of Local Variables. Technical Report ECS-LFCS-92-192, Laboratory for foundations of computer science, University of Edinburgh, 1992.

    Google Scholar 

  22. E. Olderog. Hoare's logic for programs with procedures-what has been accomplished. In E. Clarke and D. Kozen, editors, Logics of Programs, Proceedings 1983, volume 164 of Lecture Notes in Computer Science. Springer, Berlin, 1984.

    Google Scholar 

  23. G. Plotkin. Call-by-name, call-by-value and the lambda-v-calculus. Theoretical Computer Science, 1:125–159, 1975.

    Google Scholar 

  24. J. C. Reynolds. Syntactic control of interference. In Conference record of the 5th annual ACM Symposium on Principles of Programming Languages, pages 39–6, 1978.

    Google Scholar 

  25. K. Sieber. A partial correctness logic for programs (in an Algol-like language). In R. Parikh, editor, Logics of Programs, volume 193 of Lecture Notes in Computer Science. Springer, Berlin, 1985.

    Google Scholar 

  26. Scott Fraser Smith. Partial objects in type theory. Technical Report TR 88-938, Department of Computer Science, Cornell University, 1988. Ph. D. thesis.

    Google Scholar 

  27. C. L. Talcott. A theory for program and data specification. In Design and Implementation of Symbolic Computation Systems, DISCO'90, volume 429 of Lecture Notes in Computer Science, pages 91–100. Springer-Verlag, 1990. Full version to appear in TCS special issue.

    Google Scholar 

  28. M. Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988.

    Google Scholar 

  29. M. Tofte. Type inference for polymorphic references. Information and Computation, 89:1–34, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Udine University, Italy

    Furio Honsell

  2. Stanford University, USA

    Ian A. Mason & Carolyn Talcott

  3. Johns Hopkins University, USA

    Scott Smith

Authors
  1. Furio Honsell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian A. Mason
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Scott Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carolyn Talcott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Jäger H. Kleine Büning S. Martini M. M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honsell, F., Mason, I.A., Smith, S., Talcott, C. (1993). A theory of classes for a functional language with effects. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-56992-8_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56992-3

  • Online ISBN: 978-3-540-47890-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation