Explicit substitutions and programming languages

DOI10.1007/3-540-46691-6_14MaRDI QIDQ4501671zbMATH OpenFDO

Authors Jean-Jacques Lévy, Luc Maranget

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46691-6_14

zbMATH Keywords

\(\lambda\)-calculustheory of substitution in logical systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Explicit substitutions
• A Theory of Explicit Substitutions with Safe and Full Composition
• Linear explicit substitutions
• scientific article; zbMATH DE number 1722651
• The Theory of Calculi with Explicit Substitutions Revisited

Cited in

(25)

• Lazy variable-renumbering makes substitution cheap
• Formal languages defined by uniform substitutions
• Eta-conversion for the languages of explicit substitutions
• The spirit of node replication
• Dependent types and explicit substitutions: A meta-theoretical development
• scientific article; zbMATH DE number 1722651 (Why is no real title available?)
• A Theory of Explicit Substitutions with Safe and Full Composition
• The Theory of Calculi with Explicit Substitutions Revisited
• Explicit substitutions for constructive necessity
• scientific article; zbMATH DE number 1070568 (Why is no real title available?)
• Linear explicit substitutions
• scientific article; zbMATH DE number 2079037 (Why is no real title available?)
• scientific article; zbMATH DE number 1508928 (Why is no real title available?)
• scientific article; zbMATH DE number 1872989 (Why is no real title available?)
• Partial Applicative Theories and Explicit Substitutions
• scientific article; zbMATH DE number 871157 (Why is no real title available?)
• Explicit substitutions
• A Fresh Look at the λ-Calculus
• Normalization by Evaluation for Typed Weak lambda-Reduction
• Addressing machines as models of \(\lambda\)-calculus
• Node Replication: Theory And Practice
• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Extended addressing machines for PCF, with explicit substitutions
• A fully abstract model of PCF based on extended addressing machines
• Resource operators for \(\lambda\)-calculus

This page was built for publication: Explicit substitutions and programming languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501671)