Reference counting as a computational interpretation of linear logic

DOI10.1017/S0956796800001660zbMath0861.03025MaRDI QIDQ4895551

Jon G. Riecke, Carl A. Gunter, Jawahar Chirimar

Publication date: 12 May 1997

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

operational semanticslinear logicreference-countingtype correctness checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (1)

Unnamed Item

Uses Software

• Lilac

Cites Work

• Linear logic
• Computational interpretations of linear logic
• The linear abstract machine
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• A method for overlapping and erasure of lists
• An efficient, incremental, automatic garbage collector

This page was built for publication: Reference counting as a computational interpretation of linear logic