Higher-Order Abstract Syntax∗ Frank Pfenning†

First Page		Document Content
Date: 2001-01-03 16:03:41 Type theory Lambda calculus Predicate logic Logic programming Higher-order abstract syntax Unification Free variables and bound variables Simply typed lambda calculus Hindley–Milner Mathematics Theoretical computer science Mathematical logic		Higher-Order Abstract Syntax∗ Frank Pfenning† Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 147,79 KB Share Document on Facebook

	Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i DocID: 1vdfI - View Document
	Linear numeral systems Ian Mackie Abstract We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus where terms cannot be copied or erased. Our interest is threefold: representing DocID: 1uIpL - View Document
	Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onﬁnkel, 1924] applies to positive implicational logic, i.e. to the typed lam DocID: 1ulFW - View Document
	Deriving Interpretations of the Gradually-Typed Lambda Calculus Álvaro García-Pérez Pablo Nogueira DocID: 1tILC - View Document
	A Standard Theory for the Pure Lambda-Value Calculus Álvaro García-Pérez Pablo Nogueira DocID: 1tItY - View Document