A simpler lambda calculus

Jay, B

A simpler lambda calculus

Jay, B

Permalink

Publication Type:: Conference Proceeding
Citation:: PEPM 2019 - Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2019, 2019, pp. 1 - 9
Issue Date:: 2019-01-14

Closed Access

	Filename	Description	Size
	A simpler lambda calculus.pdf	Published version	643.38 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Jay, B https://orcid.org/0000-0001-8654-4305	en_US
dc.date.issued	2019-01-14	en_US
dc.identifier.citation	PEPM 2019 - Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2019, 2019, pp. 1 - 9	en_US
dc.identifier.isbn	9781450362269	en_US
dc.identifier.uri	http://hdl.handle.net/10453/134511
dc.description.abstract	© 2019 Association for Computing Machinery. Closure calculus is simpler than pure lambda-calculus as it does not mention free variables or index manipulation, variable renaming, implicit substitution, or any other meta-theory. Further, all programs, even recursive ones, can be expressed as normal forms. Third, there are reduction-preserving translations to calculi built from combinations of operators, in the style of combinatory logic. These improvements are achieved without sacrificing three fundamental properties of lambda-calculus, being a confluent rewriting system, supporting the Turing computable numerical functions, and supporting simple typing.	en_US
dc.relation.ispartof	PEPM 2019 - Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2019	en_US
dc.relation.isbasedon	10.1145/3294032.3294085	en_US
dc.title	A simpler lambda calculus	en_US
dc.type	Conference Proceeding
utslib.for	0101 Pure 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	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2019 Association for Computing Machinery. Closure calculus is simpler than pure lambda-calculus as it does not mention free variables or index manipulation, variable renaming, implicit substitution, or any other meta-theory. Further, all programs, even recursive ones, can be expressed as normal forms. Third, there are reduction-preserving translations to calculi built from combinations of operators, in the style of combinatory logic. These improvements are achieved without sacrificing three fundamental properties of lambda-calculus, being a confluent rewriting system, supporting the Turing computable numerical functions, and supporting simple typing.

Please use this identifier to cite or link to this item:

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