Encoding linear logic with interaction combinators

DOI10.1006/INCO.2002.3163MaRDI QIDQ1854547zbMATH OpenOpenAlexFDO

Authors Ian Mackie, Jorge Sousa Pinto

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.2002.3163

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Interaction nets for linear logic
• Linear logic as a logic of computations
• Computational interpretations of linear logic
• scientific article; zbMATH DE number 742718
• Linear Logics with Communication-merge
• Linearizing combinators
• scientific article; zbMATH DE number 786485
• scientific article; zbMATH DE number 4055576
• A syntax for linear logic
• scientific article; zbMATH DE number 785051

Cites work

• scientific article; zbMATH DE number 1512623 (Why is no real title available?)
• scientific article; zbMATH DE number 786495 (Why is no real title available?)
• scientific article; zbMATH DE number 860037 (Why is no real title available?)
• scientific article; zbMATH DE number 1424037 (Why is no real title available?)
• Interaction combinators
• Interaction nets for linear logic
• LCF considered as a programming language
• Linear logic
• The bologna optimal higher-order machine
• The lambda calculus. Its syntax and semantics. Rev. ed.
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(3)

• Interaction nets for linear logic
• The graphical Krivine machine
• scientific article; zbMATH DE number 1392290 (Why is no real title available?)

This page was built for publication: Encoding linear logic with interaction combinators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854547)