Proving termination of evaluation for System F with control operators

Małgorzata Biernacka 1 Dariusz Biernacki 1 Sergueï Lenglet 2 Marek Materzok 1
1 Faculty of Mathematics and Computer Science [Wroclaw]
2 PAREO - Formal islands: foundations and applications
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System F with control operators. We introduce a modified version of Girard's proof method based on reducibility candidates, where the reducibility predicates are defined on values and on evaluation contexts as prescribed by the reduction semantics format. We address both abortive control operators (callcc) and delimited-control operators (shift and reset) for which we introduce novel polymorphic type systems, and we consider both the call-by-value and call-by-name evaluation strategies.
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-00860954
Contributor : Sergueï Lenglet <>
Submitted on : Wednesday, September 11, 2013 - 3:10:51 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Links full text

arxiv

Identifiers

Collections

INRIA | UNIV-LORRAINE | LORIA-FM | LORIA

Citation

Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Marek Materzok. Proving termination of evaluation for System F with control operators. COS 2013 - First Workshop on Control Operators and their Semantics, Jun 2013, Eindhoven, Netherlands. pp.15-29, ⟨10.4204/EPTCS.127.2⟩. ⟨hal-00860954⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

214

Contact


archive-ouverte@inria.fr