Recursive programs in normal form (short paper)

Jay, B

Recursive programs in normal form (short paper)

Jay, B

Permalink

Publication Type:: Conference Proceeding
Citation:: PEPM 2018 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2018, 2017, 2017-January pp. 67 - 73
Issue Date:: 2017-12-25

Closed Access

	Filename	Description	Size
	Recursive programs in normal form.pdf	Published version	537.53 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	2017-12-25	en_US
dc.identifier.citation	PEPM 2018 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2018, 2017, 2017-January pp. 67 - 73	en_US
dc.identifier.isbn	9781450355872	en_US
dc.identifier.uri	http://hdl.handle.net/10453/134194
dc.description.abstract	© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms within some rewriting systems, including traditional combinatory logic, a new variant of lambda-calculus called closure calculus, and recent variants of combinatory logic that support queries of internal program structure. In all these settings, partial evaluation of primitive recursive functions, such as addition, can reduce open terms to normal form without fear of non-termination. In those calculi where queries of program structure are supported, program optimisations that are expressed as non-standard rewriting rules can be represented as functions in the calculus, without any need for quotation or other meta-theory.	en_US
dc.relation.ispartof	PEPM 2018 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2018	en_US
dc.relation.isbasedon	10.1145/3162067	en_US
dc.title	Recursive programs in normal form (short paper)	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2017-January	en_US
utslib.for	0803 Computer Software	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
pubs.volume	2017-January	en_US

Abstract:

© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms within some rewriting systems, including traditional combinatory logic, a new variant of lambda-calculus called closure calculus, and recent variants of combinatory logic that support queries of internal program structure. In all these settings, partial evaluation of primitive recursive functions, such as addition, can reduce open terms to normal form without fear of non-termination. In those calculi where queries of program structure are supported, program optimisations that are expressed as non-standard rewriting rules can be represented as functions in the calculus, without any need for quotation or other meta-theory.

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

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