The Library
The Y-combinator in Scott's lambda-calculus models
Tools
Tools
Tools
Park, David (1976) The Y-combinator in Scott's lambda-calculus models. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)
|
Text
WRAP_Park_cs-rr-013.pdf - Published Version Download (353Kb) | Preview |
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 > 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: |
|
||||
| Number: | Number 13 | ||||
| Number of Pages: | 8 | ||||
| Identifier: | 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 |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
