A type and scope safe universe of syntaxes with binding: their semantics and proofs

Almost every programming language’s syntax includes a notion of binder and corresponding bound occurrences, along with the accompanying notions of α-equivalence, capture avoiding substitution, typing contexts, runtime environments, and so on. In the past, implementing and reasoning about programming...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 2; no. ICFP; pp. 1 - 30
Main Authors:	Allais, Guillaume, Atkey, Robert, Chapman, James, McBride, Conor, McKinna, James
Format:	Journal Article
Language:	English
Published:	01.09.2018
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!