… However, his result is still valid in other models of computation computationally equivalent
to Turing machines such as Lambda Calculus, the base “language” used in this project. …

… termination of a single, stand-alone lambda;-expression. The second suffices to show CBV
termination … the Y combinator, and so can identify as terminating a substantial subset of PCF. …

… The classical example of randomized algorithms is about primality testing, approached by …
termination behavior of the probabilistic lambda calculus. We define the notion of termination …

This thesis investigates various formal systems for reasoning about partial functions or
partial elements, with particular emphasis on lambda calculi for partial functions. Beeson's (…

… of the variable x inside the λ-term M. We can also use it to rewrite subterms inside a λ-term. …
M may contain redexes inside M. As usual, we assume that application associates to the left …

… is tested with Petite Chez Scheme Version 8.4 from Cadence Research Systems. The following
grammar defines the syntax for the graduallytyped lambda calculus. … always terminates. …

… removing tags may introduce nontermination. If the goal were … , though our initial experiments
with naive interpreters (joint … In practice, there is no risk of non-termination since p will be …

… λ̂, a simply typed lambda calculus featuring strongly positive, finitely iterated parametric
inductive types (in the sense of, eg, [96]) and type-based termination of recursive definitions. …

… In particular, Wadsworth showed that “fiuE-convergence” can be tested within the calculus
… Clearly in our case this last interpretation is not correct (4): a terminated computation gives …

… Starting out with Gödel and ending up with Turing, it would take a long time to comprehend
and … Lambda-Calculus and Combinators in the 20th Century. In: Volume 5, pp. 723-818, of …