Explicit environments. (Extended abstract)

DOI10.1007/3-540-48959-2_24MaRDI QIDQ4263880zbMATH OpenFDO

Authors Masahiko Sato, Takafumi Sakurai, Rod Burstall

Publication date 28 February 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-48959-2_24

zbMATH Keywords

confluenceconservativityexplicit environmentssimply typed lambda calculusstrong normalizabilitysubject reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Explicit environments
• An abstract framework for environment machines
• A concrete framework for environment machines
• scientific article; zbMATH DE number 4092767
• scientific article; zbMATH DE number 3848616
• scientific article; zbMATH DE number 3596254

Cited in

(11)

• A calculus for reasoning about software composition
• Stackability in the simply-typed call-by-value lambda calculus
• Simply typed lambda calculus with first-class environments
• scientific article; zbMATH DE number 1950453 (Why is no real title available?)
• scientific article; zbMATH DE number 2172811 (Why is no real title available?)
• Counting environments and closures
• A concrete framework for environment machines
• A polymorphic environment calculus and its type-inference algorithm
• A typed context calculus
• Rod Burstall: in memoriam (1934--2025)
• Semantics of the typed -calculus with substitution in a cartesian closed category

This page was built for publication: Explicit environments. (Extended abstract)

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