Skip to main content
SpringerLink
Log in

A lambda calculus with letrecs and barriers

  • Invited Papers
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1996)

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

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, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1):375–416, 1991.

    Google Scholar 

  2. Shail Aditya, Arvind, Lennart Augustsson, Jan-Willem Maessen, and Rishiyur S. Nikhil. Semantics of pH: A Parallel Dialect of Haskell. In in Proc. Haskell Workshop (at FPCA 95), La Jolla, CA, June 1995.

    Google Scholar 

  3. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. In Proc. ACM Conference on Principles of Programming Languages, pages 233–246, 1995.

    Google Scholar 

  4. Z. M. Ariola and J. W. Klop. Lambda calculus with explicit recursion. Technical Report CIS-TR-96-04, Department of Computer and Information Science, University of Oregon, 1996.

    Google Scholar 

  5. Zena M. Ariola and Arvind. A Syntactic Approach to Program Transformations. In Proc. Symp. on Partial Evaluation and Semantics Based Program Manipulation, Yale University, New Haven, CT, June 1991. Also CSG Memo 322, MIT Lab for Computer Science.

    Google Scholar 

  6. Z.M. et al. Ariola. Cyclic lambda calculi. Technical Report CIS-TR-96-??, Department of computer and information science, University of Oregon, 1996.

    Google Scholar 

  7. Arvind, Rishiyur Sivaswami Nikhil, and Keshav Kumar Pingali. I-Structures: Data Structures for Parallel Computing. ACM Transactions on Programming Languages and Systems, 11(4):598–632, October 1989.

    Google Scholar 

  8. William Clinger and Jonathan Rees (eds.). Revised4 Report on the Algorithmic Language Scheme. Technical report, MIT AI Laboratory, November 2 1991.

    Google Scholar 

  9. Paul Hudak, Simon Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph Fasel, Maria M. Guzman, Kevin Hammond, John Hughes, Thomas Johnsson, Richard Kieburtz, Rishiyur Nikhil, Will Partain, and John Peterson. Report on the Programming Language Haskell, A Non-strict, Purely Functional Language, Version 1.2. ACM SIGPLAN Notices, 27(5), May 1992.

    Google Scholar 

  10. J. Launchbury. A natural semantics for lazy evaluation. In Proc. ACM Conference on Principles of Programming Languages, pages 144–154, 1993.

    Google Scholar 

  11. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, 990.

    Google Scholar 

  12. Rishiyur Sivaswami Nikhil. Id (Version 90.1) Language Reference Manual. Technical Report CSG Memo 284-2, MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, USA, July 15 1991.

    Google Scholar 

  13. Guy L. Steele Jr. Common Lisp: The Language. Digital Press, second edition, 1990.

    Google Scholar 

  14. C. P. Wadsworth. Semantics and pragmatics of the lambda-calculus. D.Phil. thesis, University of Oxford, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT Laboratory for Computer Science, USA

    Arvind & Jan-Willem Maessen

  2. DEC Cambridge Research Laboratory, USA

    Rishiyur S. Nikhil

  3. Oxford University Computing Laboratory, UK

    Joseph Stoy

Authors
  1. Arvind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan-Willem Maessen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rishiyur S. Nikhil
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joseph Stoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Chandru V. Vinay

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, Maessen, JW., Nikhil, R.S., Stoy, J. (1996). A lambda calculus with letrecs and barriers. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-62034-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62034-1

  • Online ISBN: 978-3-540-49631-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation