Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-26T09:18:00.660Z Has data issue: false hasContentIssue false
  • English
  • Français

On the number of fixed points of a combinator in lambda calculus

Published online by Cambridge University Press:  10 November 2000

B. INTRIGILA  and
E. BIASONE
B. INTRIGILA
Affiliation:
Dipartimento di Matematica Pura e Applicata, Universitá Di L'Aquila, Via Vetoio, 67010 Coppito, L'Aquila, Italy. Email: intrigil@univaq.it and e.biasone@reply.it
E. BIASONE
Affiliation:
Dipartimento di Matematica Pura e Applicata, Universitá Di L'Aquila, Via Vetoio, 67010 Coppito, L'Aquila, Italy. Email: intrigil@univaq.it and e.biasone@reply.it
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the problem of determining the number of fixed points of a combinator (a closed λ-term). This appears to be a still unsolved problem. We give a partial answer by showing that if there is a fixed point in normal form, then this fixed point is unique or there are infinitely many fixed points.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 10 , Issue 5 , October 2000 , pp. 595 - 615
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)