Skip to main content
Article thumbnail
Location of Repository

Termination Combinators Forever

By Maximilian Bolingbroke, Simon Peyton Jones and Dimitrios Vytiniotis

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

Topics: General Terms Algorithms, Theory
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.2863
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://research.microsoft.com/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.