Corrigenda to: ``The linear abstract machine

DOI10.1016/0304-3975(88)90074-6zbMath0659.68016OpenAlexW1977898832MaRDI QIDQ1112582

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)90074-6

zbMATH Keywords

linear logiclazy evaluationsemanticsimplementationfunctional programmingside 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 (3)

Accessible categories and models of linear logic ⋮ A linear/producer/consumer model of classical linear logic ⋮ Contraction-free Proofs and Finitary Games for Linear Logic

This page was built for publication: Corrigenda to: ``The linear abstract machine