Linearity and iterator types for Gödel's system \(\mathcal T\)
From MaRDI portal
Publication:656851
DOI10.1007/s10990-010-9060-xzbMath1242.03032OpenAlexW2069915317MaRDI QIDQ656851
Maribel Fernández, Mário Florido, Ian Mackie, Sandra Alves
Publication date: 13 January 2012
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-010-9060-x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Computational interpretations of linear logic
- Gödel's system \(\mathcal T\) revisited
- An extension of basic functionality theory for \(\lambda\)-calculus
- A theory of type polymorphism in programming
- An internal language for autonomous categories
- Logic programming in a fragment of intuitionistic linear logic
- Intersection type assignment systems
- Type error slicing in implicitly typed higher-order languages
- On theories with a combinatorial definition of 'equivalence'
- The Power of Closed Reduction Strategies
- A filter lambda model and the completeness of type assignment
- The Power of Linear Functions
- An Efficient Unification Algorithm
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- Term Rewriting and All That
- Lilac: a functional programming language based on linear logic
- A Machine-Oriented Logic Based on the Resolution Principle
- Typed Lambda Calculi and Applications
- Iterator Types
This page was built for publication: Linearity and iterator types for Gödel's system \(\mathcal T\)
