Conference Proceedings

Explicit substitutions

Conference Record of the Annual ACM Symposium on Principles of Programming Languages (1990) 31-46
DOI: 10.1145/96709.96712
122Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Abadi, M., Cardelli, L., Curien, P. L., & Levy, J. J. (1990). Explicit substitutions. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 31–46). Publ by ACM. https://doi.org/10.1145/96709.96712

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free