Park, David (1976) The Y-combinator in Scott's lambda-calculus models. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Park_cs-rr-013.pdf - Published Version Download (353Kb) | Preview

Request Changes to record.

Abstract

Assume the notation and terminology of Dana Scott's paper
"Models for the Lambda-Calculus". In this note I want to exhibit the
relationship between the lambda-calculus "paradoxical operator"
Y = λx((λy.x(yy))λy.x(yy))
and the minimal fixpoint operator
Y* = λx.∞Un=0 xnΩ
obtained by regarding the lambda-calculus model as a lattice.

Item Type:	Report
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Lambda calculus
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	June 1976
Dates:	Date Event June 1976 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 13
Number of Pages:	8
DOI:	CS-RR-013
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads