Skip to main content
    • Aa
    • Aa

Explicit substitutions

  • M. Abadi (a1), L. Cardelli (a1), P.-L. Curien (a2) and J.-J. Lévy (a3)

The λσ-calculus is a refinement of the λ-calculus where substitutions are manipulated explicitly. The λσ-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λ-calculus and concrete implementations.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

T. Hardin 1989. Confluence results for the pure strong categorical combinatory logic CCL: λ-calculi as subsystems of CCL, Theor. Comput. Sci. 65: 291342.

T. Hardin and A. Laville 1986. Proof of termination of rewriting system SUBST on CCL. Theor. Comput. Sci. 46: 305–12.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 23 *
Loading metrics...

Abstract views

Total abstract views: 345 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 29th June 2017. This data will be updated every 24 hours.