Computation in Focused Intuitionistic Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Computation in Focused Intuitionistic Logic


We investigate the control of evaluation strategies in a variant of the λ-calculus derived through the Curry-Howard correspondence from LJF, a sequent calculus for intuitionistic logic implementing the focusing technique. The proof theory of focused intuitionistic logic yields a single calculus in which a number of known λ-calculi appear as subsystems obtained by restricting types to a certain fragment of LJF. In particular, standard λ-calculi as well as the call-by-push-value calculus are analysed using this framework, and we relate cut elimination for LJF to a new abstract machine subsuming well-known machines for these different strategies.
Fichier principal
Vignette du fichier
ppdp15computation.pdf (224.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01249216 , version 1 (30-12-2015)


Attribution - NoDerivatives



Taus Brock-Nannestad, Nicolas Guenot, Daniel Gustafsson. Computation in Focused Intuitionistic Logic. 17th International Symposium on Principles and Practice of Declarative Programming, Jul 2015, Siena, Italy. ⟨10.1145/2790449.2790528⟩. ⟨hal-01249216⟩
611 View
388 Download



Gmail Facebook Twitter LinkedIn More