The Power of Closed Reduction Strategies
From MaRDI portal
Publication:2866800
DOI10.1016/j.entcs.2007.02.047zbMath1277.03009OpenAlexW1966558275MaRDI QIDQ2866800
Ian Mackie, Sandra Alves, Maribel Fernández, Mário Florido
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.047
Related Items
Linearity and iterator types for Gödel's system \(\mathcal T\) ⋮ Gödel's system \(\mathcal T\) revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Computational interpretations of linear logic
- Combinatory weak reduction in lambda calculus
- Combinatory reduction systems: Introduction and survey
- An internal language for autonomous categories
- Linear types and non-size-increasing polynomial time computation.
- On theories with a combinatorial definition of 'equivalence'
- The Power of Linear Functions
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- Confluence of terminating membership conditional TRS
This page was built for publication: The Power of Closed Reduction Strategies