The categorical abstract machine
From MaRDI portal
Publication:1097043
DOI10.1016/0167-6423(87)90020-7zbMath0634.68078MaRDI 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
Cartesian closed category; \(\lambda \)-calculus; functional programming languages; categorical abstract machine
68Q45: Formal languages and automata
18D15: Closed categories (closed monoidal and Cartesian closed categories, etc.)
18B20: Categories of machines, automata
03B40: Combinatory logic and lambda calculus
Related Items
From operational semantics to abstract machines, The Impact of the Lambda Calculus in Logic and Computer Science, A categorical understanding of environment machines, Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†, Using transformations in the implementation of higher-order functions, An abstract framework for environment machines, Formal compiler construction in a logical framework, Alpha conversion, conditions on variables and categorical logic, Unique normal forms for lambda calculus with surjective pairing, Partiality, cartesian closedness, and toposes, A notation for lambda terms. A generalization of environments, Conditional rewriting logic as a unified model of concurrency, Categorical abstract machines for higher-order typed \(\lambda\)-calculi, Unnamed Item, π-RED+ An interactive compiling graph reduction system for an applied λ-calculus, On the efficiency of categorical combinators as a rewriting system
