The linear abstract machine

DOI10.1016/0304-3975(88)90100-4zbMath0648.68016MaRDI 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 evaluation; semantics; implementation; functional programming; Linear logic; side effects; garbage collector; strict evaluation

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68Q65: Abstract data types; algebraic specification

03F05: Cut-elimination and normal-form theorems

68N01: General topics in the theory of software

Related Items

The Logic of Bunched Implications, Quantales, observational logic and process semantics, A model for syntactic control of interference, Retrieving library functions by unifying types modulo linear isomorphism, From Petri nets to linear logic, FUZZY CHU SPACES AND FUZZY TOPOLOGIES, Reference counting as a computational interpretation of linear logic, Computational interpretations of linear logic, Notions of computation and monads, Language in action, Conditional rewriting logic as a unified model of concurrency, Decision problems for propositional linear logic, Linearizing intuitionistic implication, Linear logic with fixed resources, Semantic data modelling using linear logic, Completeness results for linear logic on Petri nets, Relating categorical semantics for intuitionistic linear logic, European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991, Unnamed Item, A new constructive logic: classic logic

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