A Context-based Approach to Proving Termination of Evaluation

Authors:
Małgorzata Biernacka;Dariusz Biernacki
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 13
Cited 0

A syntactic theory of sequential control

Theoretical Computer Science
The theory and practice of first-class prompts

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstracting control

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The revised report on the syntactic theories of sequential control and state

Theoretical Computer Science
A syntactic approach to type soundness

Information and Computation
Program Extraction from Normalization Proofs

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Intuitionistic model constructions and normalization proofs

Mathematical Structures in Computer Science
A syntactic correspondence between context-sensitive calculi and abstract machines

Theoretical Computer Science
A proof-theoretic foundation of abortive continuations

Higher-Order and Symbolic Computation
Defunctionalized interpreters for programming languages

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Program Extraction From Proofs of Weak Head Normalization

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 its computational content that takes the form of an evaluator in continuation-passing style and is an instance of normalization by evaluation.