Infinitary affine proofs
From MaRDI portal
Publication:5268998
DOI10.1017/S0960129515000298zbMath1423.03249OpenAlexW1429272185WikidataQ113857444 ScholiaQ113857444MaRDI QIDQ5268998
Publication date: 14 June 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129515000298
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational ludics
- Linear logic
- Uniformity and the Taylor expansion of ordinary lambda-terms
- Fundamental properties of infinite trees
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem
- Infinitary lambda calculus
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Polarized games
- Asynchronous games. II: The true concurrency of innocence
- Locus Solum: From the rules of logic to the logic of rules
- An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- A new constructive logic: classic logic
- Abstract Böhm trees
- Termination and confluence in infinitary term rewriting
- A linearization of the Lambda-calculus and consequences
- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
- Finiteness spaces
This page was built for publication: Infinitary affine proofs
