A Metalanguage for Programming with Bound Names Modulo Renaming

A Metalanguage for Programming with Bound Names Modulo Renaming (2000)

Cached

Download Links

[ftp.cl.cam.ac.uk]

Other Repositories/Bibliography

DBLP

by Andrew M. Pitts , Murdoch J. Gabbay

Venue:	Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science
Citations:	81 - 13 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Metalanguage for Programming with Bound Names Modulo Renaming	user correction - Legacy Corrections
AUTHOR NAME	Andrew M. Pitts	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	Murdoch J. Gabbay	user correction - Legacy Corrections
AUTHOR AFFIL	; 2; 1; Cambridge University Computer Laboratory, Cambridge CB2 3QG, UK; Cambridge University, Cambridge CB2 1SB, UK	user correction - Legacy Corrections
ABSTRACT	This paper describes work in progress on the design of an ML-style metalanguage FreshML for programming with recursively defined functions on user-defined, concrete data types whose constructors may involve variable binding. Up to operational equivalence, values of such FreshML data types can faithfully encode terms modulo alpha-conversion for a wide range of object languages in a straightforward fashion. The design of FreshML is `semantically driven', in that it arises from the model of variable binding in set theory with atoms given by the authors in [7]. The language has a type constructor for abstractions over names ( = atoms) and facilities for declaring locally fresh names. Moreover, recursive definitions can use a form of pattern-matching on bound names in abstractions. The crucial point is that the FreshML type system ensures that these features can only be used in well-typed programs in ways that are insensitive to renaming of bound names.	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	230--255	INFERENCE
VOLUME	1837	INFERENCE
CITATIONS	16 found	ParsCit 1.0