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

	logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := \| nil_dep : natlist_dep 0 DocID: 1pROH - View Document
	Reasoning about Programs in Continuation-Passing Style Amr Sabry Matthias Felleisen Department of Computer Science DocID: 1ppe8 - View Document
	Microsoft PowerPoint - Lect14lecture_env3.ppt DocID: 1ph50 - View Document
	Crafting a Repository of Knowledge Based on Transformation Rules A.D. Rich (1) and D.J. JeffreyLoli’i Way, Kamuela, Hawaii, USA. DocID: 1pgPS - View Document
	BRICS Basic Research in Computer Science BRICS RSDanvy & Rose: Higher-Order Rewriting and Partial Evaluation Higher-Order Rewriting and DocID: 1oZoU - View Document