Taming Modal Impredicativity: Superlazy Reduction
From MaRDI portal
Publication:3605525
DOI10.1007/978-3-540-92687-0_10zbMath1211.03091arXiv0810.2891OpenAlexW1793428466MaRDI QIDQ3605525
Luca Vercelli, Ugo Dal Lago, Luca Roversi
Publication date: 24 February 2009
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.2891
Related Items
Cites Work
- Bounded linear logic: A modular approach to polynomial-time computability
- Light linear logic
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Head linear reduction and pure proof net extraction
- Soft linear logic and polynomial time
- A characterization of alternating log time by ramified recurrence
- Tiering as a Recursion Technique
- Taming Modal Impredicativity: Superlazy Reduction
- Stratified polymorphism and primitive recursion