A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Context-based Approach to Proving Termination of Evaluation
2009
Electronical Notes in Theoretical Computer Science
We present a context-based approach to proving termination of evaluation in reduction semantics (i.e., a form of operational semantics with explicit representation of reduction contexts), using Tait-style reducibility predicates defined on both terms and contexts. We consider the simply typed lambda calculus as well as its extension with abortive control operators for first-class continuations under the call-by-value and the call-by-name evaluation strategies. For each of the proofs we present
doi:10.1016/j.entcs.2009.07.090
fatcat:firz4v2zebfmxpvqkiyatry5fe