The linear abstract machine

DOI10.1016/0304-3975(88)90100-4zbMath0648.68016OpenAlexW3145063512MaRDI QIDQ1105351

Yves Lafont

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90100-4

zbMATH Keywords

lazy evaluationsemanticsimplementationfunctional programmingLinear logicside effectsgarbage collectorstrict evaluation

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Cut-elimination and normal-form theorems (03F05) General topics in the theory of software (68N01)

Related Items

Linear logic with fixed resources, A syntax for linear logic, The Logic of Bunched Implications, Decomposing typed lambda calculus into a couple of categorical programming languages, Semantic data modelling using linear logic, Quantales, observational logic and process semantics, Completeness results for linear logic on Petri nets, A model for syntactic control of interference, FUZZY CHU SPACES AND FUZZY TOPOLOGIES, A new constructive logic: classic logic, Retrieving library functions by unifying types modulo linear isomorphism, Quantitative domains, groupoids and linear logic, Declarative continuations: An investigation of duality in programming language semantics, From petri nets to linear logic, Linear Exponential Comonads without Symmetry, Quantitative weak linearisation, Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic, Unnamed Item, Language in action, Reference counting as a computational interpretation of linear logic, Conditional rewriting logic as a unified model of concurrency, Decision problems for propositional linear logic, Computational interpretations of linear logic, Preface to the special volume, Linearizing intuitionistic implication, Relating categorical semantics for intuitionistic linear logic, Contraction-free Proofs and Finitary Games for Linear Logic, From Petri nets to linear logic, Notions of computation and monads, Unnamed Item, European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991

Cites Work

• Linear logic
• Algebra of proofs
• On MacLane's conditions for coherence of natural associativities, commutativities, etc
• Deductive systems and categories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item