Year: 2025
Type: preprint
Abstract: The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus are considered as partial functions on the set of reduced lambda-terms, they inherit such a partial order. We prove that Curry's well-known fixed point combinator Y produces least fixed points with respect to this partial order.
Source: arXiv (Cornell University)
Author: Helfer, Joseph
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416894779
Cites:
Cited by:
Related to: