Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract

First Page		Document Content
Date: 2010-10-22 08:04:54 Lambda calculus Combinatory logic Church encoding Fixed-point combinator Anonymous function Higher-order abstract syntax Type system Unification De Bruijn index Lambda calculus definition		Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract Add to Reading List Source URL: repository.readscheme.org Download Document from Source Website File Size: 120,33 KB Share Document on Facebook

	Parametric Higher-Order Abstract Syntax for Mechanized Semantics Adam Chlipala Harvard University DocID: 1xUkW - View Document
	Reflecting Higher-Order Abstract Syntax in Nuprl? Eli Barzilay and Stuart Allen Cornell University {eli,sfa}@cs.cornell.edu Abstract. This document describes part of an effort to achieve in Nuprl a practical reflection o DocID: 1uwcL - View Document
	Programming type-safe transformations using higher-order abstract syntax Olivier Savary-Belanger1 , Stefan Monnier2 , and Brigitte Pientka1 1 2 DocID: 1tekM - View Document
	Practical Reflection in Nuprl Eli Barzilay Stuart Allen Robert Constable DocID: 1qzvV - View Document
	c 2005 Cambridge University Press JFP 15 (6), Meta-Programming through Typeful DocID: 1quHR - View Document