An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$
From MaRDI portal
Publication:2798262
DOI10.1007/978-3-319-29604-3_6zbMath1475.68067OpenAlexW2398670242MaRDI QIDQ2798262
Publication date: 4 April 2016
Published in: Functional and Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29604-3_6
Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Gödel's system \(\mathcal T\) revisited
- The rewriting calculus - part II
- The Power of Linear Functions
- The bologna optimal higher-order machine
- Encoding left reduction in the λ-calculus with interaction nets
- YALE
- Typed Lambda Calculi and Applications
This page was built for publication: An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$