Minimality in a Linear Calculus with Iteration
From MaRDI portal
Publication:2873683
DOI10.1016/j.entcs.2008.03.060zbMath1279.68045MaRDI QIDQ2873683
Sandra Alves, Ian Mackie, François-Régis Sinot, Mário Florido
Publication date: 24 January 2014
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.2008.03.060
68N18: Functional programming and lambda calculus
03F52: Proof-theoretic aspects of linear logic and other substructural logics
03B40: Combinatory logic and lambda calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- IO and OI. I
- System \(T\), call-by-value and the minimum problem
- Type fixpoints
- The Power of Linear Functions
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- Stable results and relative normalization
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- Random Descent
- Iterator Types
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Logical Approaches to Computational Barriers