An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine

DOI10.1016/S1571-0661(04)80356-6zbMath1268.68054OpenAlexW2040290487MaRDI QIDQ2841304

Shinichi Yamada, Toru Sugimoto, Shinya Sato

Publication date: 24 July 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80356-6

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Computational interpretations of linear logic
• The chemical abstract machine
• LCF considered as a programming language
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• YALE

This page was built for publication: An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine