A categorical understanding of environment machines

DOI10.1017/S0956796800000253zbMath0841.18002MaRDI QIDQ4763978

Andrea Asperti

Publication date: 1 May 1995

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

Cartesian closed categoriescategorical semanticslambda calculicategorical abstract machine

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of machines, automata (18B20) Combinatory logic and lambda calculus (03B40)

Related Items

The next 700 Krivine machines ⋮ Minimal immersions of curvature pinched 2-manifolds into spheres ⋮ A compact kernel for the calculus of inductive constructions

Cites Work

• Unnamed Item
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• The categorical abstract machine
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Proof of termination of the rewriting system SUBSET on CCL