8 research outputs found
A-Translation and Looping Combinators in Pure Type Systems
http://www.cambridge.orgWe present here a generalization of A-translation to a class of Pure Type Systems. We apply this translation to give a direct proof of the existence of a looping combinator in a large class of inconsistent type systems including type systems with a type of all types. This is the first non-automated solution to this problem
Fixed point combinators as fixed points of higher-order fixed point generators
Corrado B\"ohm once observed that if is any fixed point combinator (fpc),
then is again fpc. He thus discovered the first "fpc
generating scheme" -- a generic way to build new fpcs from old. Continuing this
idea, define an to be any sequence of terms
such that
In this contribution, we take first steps in studying the structure of (weak)
fpc generators. We isolate several robust classes of such generators, by
examining their elementary properties like injectivity and (weak) constancy. We
provide sufficient conditions for existence of fixed points of a given
generator : an fpc such that . We
conjecture that weak constancy is a necessary condition for existence of such
(higher-order) fixed points. This statement generalizes Statman's conjecture on
non-existence of "double fpcs": fixed points of the generator discovered by B\"ohm.
Finally, we define and make a few observations about the monoid of (weak) fpc
generators. This enables us to formulate new a conjecture about their
structure
Discriminating Lambda-Terms Using Clocked Boehm Trees
As observed by Intrigila, there are hardly techniques available in the
lambda-calculus to prove that two lambda-terms are not beta-convertible.
Techniques employing the usual Boehm Trees are inadequate when we deal with
terms having the same Boehm Tree (BT). This is the case in particular for fixed
point combinators, as they all have the same BT. Another interesting equation,
whose consideration was suggested by Scott, is BY = BYS, an equation valid in
the classical model P-omega of lambda-calculus, and hence valid with respect to
BT-equality but nevertheless the terms are beta-inconvertible. To prove such
beta-inconvertibilities, we employ `clocked' BT's, with annotations that convey
information of the tempo in which the data in the BT are produced. Boehm Trees
are thus enriched with an intrinsic clock behaviour, leading to a refined
discrimination method for lambda-terms. The corresponding equality is strictly
intermediate between beta-convertibility and Boehm Tree equality, the equality
in the model P-omega. An analogous approach pertains to Levy-Longo and
Berarducci Trees. Our refined Boehm Trees find in particular an application in
beta-discriminating fixed point combinators (fpc's). It turns out that Scott's
equation BY = BYS is the key to unlocking a plethora of fpc's, generated by a
variety of production schemes of which the simplest was found by Boehm, stating
that new fpc's are obtained by postfixing the term SI, also known as Smullyan's
Owl. We prove that all these newly generated fpc's are indeed new, by
considering their clocked BT's. Even so, not all pairs of new fpc's can be
discriminated this way. For that purpose we increase the discrimination power
by a precision of the clock notion that we call `atomic clock'.Comment: arXiv admin note: substantial text overlap with arXiv:1002.257
A-translation and Looping Combinators in Pure Type Systems
We present here a generalization of A-translation to a class of Pure Type Systems. We apply this translation to give a direct proof of the existence of a looping combinator in a large class of inconsistent type systems, class which includes type systems with a type of all types. This is the first non-automated solution to this problem