Abstract : 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.
https://hal.inria.fr/hal-01249216 Contributor : Taus Brock-NannestadConnect in order to contact the contributor Submitted on : Wednesday, December 30, 2015 - 4:53:36 PM Last modification on : Wednesday, February 2, 2022 - 3:55:17 PM Long-term archiving on: : Tuesday, April 5, 2016 - 1:47:44 PM
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⟩