Conflicting accounts of λ-definability

Publication Type:
Journal Article
Journal of Logical and Algebraic Methods in Programming, 2017, 87 pp. 1 - 3
Issue Date:
Full metadata record
© 2016 A function on some domain is λ-definable if the corresponding function of λ-terms is so definable. However, the correspondence is parametrized by a representation of the domain. Often there is a natural choice of representation, but when the domain consists of λ-terms then they can be represented by either themselves or by the Church numeral of their Gödel number. This choice determines whether or not all computable functions are λ-definable.
Please use this identifier to cite or link to this item: