Conflicting accounts of λ-definability

Jay, B; Vergara, J

Conflicting accounts of λ-definability

Jay, B

Vergara, J

Permalink

Publication Type:: Journal Article
Citation:: Journal of Logical and Algebraic Methods in Programming, 2017, 87 pp. 1 - 3
Issue Date:: 2017-02-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted manuscript versionAdobe PDF (180.13 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Jay, B https://orcid.org/0000-0001-8654-4305	en_US
dc.contributor.author	Vergara, J	en_US
dc.date.available	2020-05-25T19:13:42Z
dc.date.issued	2017-02-01	en_US
dc.identifier.citation	Journal of Logical and Algebraic Methods in Programming, 2017, 87 pp. 1 - 3	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125511
dc.description.abstract	© 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.	en_US
dc.relation.ispartof	Journal of Logical and Algebraic Methods in Programming	en_US
dc.relation.isbasedon	10.1016/j.jlamp.2016.11.001	en_US
dc.title	Conflicting accounts of λ-definability	en_US
dc.type	Journal Article
utslib.citation.volume	87	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	87	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/125511