Explicit substitutions

Authors:
M. Abadi;L. Cardelli;P.-L. Curien;J.-J. Levy
Affiliations:
Digital Equipment Corporation, Systems Research Center;Digital Equipment Corporation, Systems Research Center;Ecole Normale Supérieure and Digital Equipment Corporation;INRIA Rocquencourt and Digital Equipment Corporation
Venue:
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1989

Citing 2
Cited 51

Proof of termination of the rewriting system SUBST on CCL

Theoretical Computer Science
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)

Categorical combinators, sequential algorithms, and functional programming (2nd ed.)

Incremental reduction in the lambda calculus

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
An abstract machine for Lambda-terms normalization

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A confluent calculus of Macro expansion and evaluation

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Optimal reduction in weak-&lgr;-calculus with shared environments

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The typed polymorphic label-selective λ-calculus

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An operational framework for value-passing processes

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional back-ends within the lambda-sigma calculus

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Program fragments, linking, and modularization

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A systematic study of functional language implementations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing typed intermediate languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
External Rewriting for Skeptical Proof Assistants

Journal of Automated Reasoning
Computing with Contexts

Higher-Order and Symbolic Computation
Cut Elimination for Classical Proofs as Continuation Passing Style Computation

ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Programming and Computing in HOL

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Conjunctive Types and SKInT

TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Game semantics and abstract machines

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Dynamic rebinding for marshalling and update, with destruct-time ?

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
The call-by-need lambda calculus

Journal of Functional Programming
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions

Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Strongly reducing variants of the Krivine abstract machine

Higher-Order and Symbolic Computation
On the correctness of the Krivine machine

Higher-Order and Symbolic Computation
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
On strong normalization and type inference in the intersection type discipline

Theoretical Computer Science
A type system for data-flow integrity on windows vista

Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction

Journal of Functional Programming
Inter-deriving Semantic Artifacts for Object-Oriented Programming

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Abstract λ-Calculus Machines

Central European Functional Programming School
Compositional reasoning and decidable checking for dependent contract types

Proceedings of the 3rd workshop on Programming languages meets program verification
A rewriting logic approach to operational semantics

Information and Computation
A type system for data-flow integrity on Windows Vista

ACM SIGPLAN Notices
Sequent calculi and abstract machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Big-step normalisation

Journal of Functional Programming
Higher-order term indexing using substitution trees

ACM Transactions on Computational Logic (TOCL)
Fresh O'Caml: Nominal Abstract Syntax for the Masses

Electronic Notes in Theoretical Computer Science (ENTCS)
A finite first-order presentation of set theory

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Towards compatible and interderivable semantic specifications for the scheme programming language, part II: reduction semantics and abstract machines

Semantics and algebraic specification
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Small proof witnesses for LF

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Tabling for higher-order logic programming

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A lambda calculus with forms

SC'05 Proceedings of the 4th international conference on Software Composition
Axiomatic rewriting theory i: a diagrammatic standardization theorem

Processes, Terms and Cycles
GLoo: a framework for modeling and reasoning about component-oriented language abstractions

CBSE'06 Proceedings of the 9th international conference on Component-Based Software Engineering
Explicit stabilisation for modular rely-guarantee reasoning

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus

Fundamenta Informaticae
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus

Fundamenta Informaticae
Compiling contextual objects: bringing higher-order abstract syntax to programmers

PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
First-class substitutions in contextual type theory

Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

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