Termination combinators forever

Authors:
Maximilian Bolingbroke;Simon Peyton Jones;Dimitrios Vytiniotis
Affiliations:
University of Cambridge, Cambridge, United Kingdom;Microsoft Research Cambridge, Cambridge, United Kingdom;Microsoft Research Cambridge, Cambridge, United Kingdom
Venue:
Proceedings of the 4th ACM symposium on Haskell
Year:
2011

Citing 9
Cited 0

Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Distillation: extracting the essence of programs

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Positive supercompilation for a higher order call-by-value language

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of the iterator pattern

Journal of Functional Programming
Generic programming with fixed points for mutually recursive datatypes

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Datatype-generic programming

SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Supercompilation by evaluation

Proceedings of the third ACM Haskell symposium on Haskell
Rethinking supercompilation

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a library-based approach to constructing termination tests suitable for controlling termination of symbolic methods such as partial evaluation, supercompilation and theorem proving. With our combinators, all termination tests are correct by construction. We show how the library can be designed to embody various optimisations of the termination tests, which the user of the library takes advantage of entirely transparently.