BRICS Basic Research in Computer Science

First Page		Document Content
Date: 1999-09-23 18:42:18 Lambda calculus Subroutines Recursion Theoretical computer science Computability theory Lambda lifting Fold Closure Scheme Software engineering Computing Computer programming		BRICS Basic Research in Computer Science Add to Reading List Source URL: www.brics.dk Download Document from Source Website File Size: 356,63 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