The categorical abstract machine

DOI10.1016/0167-6423(87)90020-7zbMath0634.68078OpenAlexW1963658586MaRDI QIDQ1097043

Pierre-Louis Curien, Guy Cousineau, Michel Mauny

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90020-7

zbMATH Keywords

Cartesian closed category\(\lambda \)-calculusfunctional programming languagescategorical abstract machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of machines, automata (18B20) Combinatory logic and lambda calculus (03B40)

Related Items (29)

Decomposing typed lambda calculus into a couple of categorical programming languages ⋮ Categorical abstract machines for higher-order typed \(\lambda\)-calculi ⋮ Compilation of extended recursion in call-by-value functional languages ⋮ From operational semantics to abstract machines ⋮ Formal compiler construction in a logical framework ⋮ Unique normal forms for lambda calculus with surjective pairing ⋮ Partiality, cartesian closedness, and toposes ⋮ A notation for lambda terms. A generalization of environments ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ On the efficiency of categorical combinators as a rewriting system ⋮ iRho: an imperative rewriting calculus ⋮ Alpha conversion, conditions on variables and categorical logic ⋮ Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^† ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ The next 700 Krivine machines ⋮ State-transition machines, revisited ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ On Extracting Static Semantics ⋮ New Developments in Environment Machines ⋮ A verified framework for higher-order uncurrying optimizations ⋮ Using transformations in the implementation of higher-order functions ⋮ Coinductive big-step operational semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES ⋮ π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus ⋮ Definability and Full Abstraction ⋮ An abstract framework for environment machines ⋮ A categorical understanding of environment machines

This page was built for publication: The categorical abstract machine