The set of fixed-point combinators is recursively enumerable. Enumerate closed lambda terms and finite proofs of beta equivalence, and output whenever a proof of appears for a fresh variable .

Ancestors (9)

  1. Fixed-point combinator
  2. Combinator
  3. Untyped lambda calculus
  4. Lambda calculus
  5. Computability theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version