Computer Science – Programming Languages
Scientific paper
2008-01-06
LMCS-2007-238
Computer Science
Programming Languages
Scientific paper
10.2168/LMCS-4(1:3)2008
A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value). The ``size-change principle'' from first-order programs is extended to arbitrary untyped lambda-expressions in two steps. The first step suffices to show CBV termination of a single, stand-alone lambda;-expression. The second suffices to show CBV termination of any member of a regular set of lambda-expressions, defined by a tree grammar. (A simple example is a minimum function, when applied to arbitrary Church numerals.) The algorithm is sound and proven so in this paper. The Halting Problem's undecidability implies that any sound algorithm is necessarily incomplete: some lambda-expressions may in fact terminate under CBV evaluation, but not be recognised as terminating. The intensional power of the termination algorithm is reasonably high. It certifies as terminating many interesting and useful general recursive algorithms including programs with mutual recursion and parameter exchanges, and Colson's ``minimum'' algorithm. Further, our type-free approach allows use of the Y combinator, and so can identify as terminating a substantial subset of PCF.
Bohr Nina
Jones Neil D.
No associations
LandOfFree
Call-by-value Termination in the Untyped lambda-calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Call-by-value Termination in the Untyped lambda-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Call-by-value Termination in the Untyped lambda-calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-507333