Skip to Main content Skip to Navigation
Conference papers

Classical call-by-need sequent calculi : The unity of semantic artifacts

Zena Ariola 1 Paul Downen 1 Hugo Herbelin 2, 3 Keiko Nakata 4 Alexis Saurin 2, 3 
3 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : We systematically derive a classical call-by-need sequent calculus, which does not require an unbounded search for the standard redex, by using the unity of semantic artifacts proposed by Danvy et al. The calculus serves as an intermediate step toward the generation of an environment-based abstract machine. The resulting abstract machine is context-free, so that each step is parametric in all but one component. The context-free machine elegantly leads to an environment-based CPS transformation. This transformation is observationally different from a natural classical extension of the transformation of Okasaki et al., due to duplication of un-evaluated bindings.
Document type :
Conference papers
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Hugo Herbelin Connect in order to contact the contributor
Submitted on : Tuesday, May 15, 2012 - 3:56:03 AM
Last modification on : Friday, January 21, 2022 - 3:13:35 AM
Long-term archiving on: : Friday, November 30, 2012 - 11:41:23 AM


Files produced by the author(s)




Zena Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin. Classical call-by-need sequent calculi : The unity of semantic artifacts. FLOPS 2012 - 11th International Symposium on Functional and Logic Programming, May 2012, Kobe, Japan. pp.32-46, ⟨10.1007/978-3-642-29822-6⟩. ⟨hal-00697241⟩



Record views


Files downloads