<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic in computer science / Lambda calculus / Proof theory / Dependently typed programming / Curry–Howard correspondence / Intuitionistic type theory / Combinatory logic / Natural deduction / Mathematics / Mathematical logic / Type theory
Date: 2012-11-02 09:24:49
Theoretical computer science
Logic in computer science
Lambda calculus
Proof theory
Dependently typed programming
Curry–Howard correspondence
Intuitionistic type theory
Combinatory logic
Natural deduction
Mathematics
Mathematical logic
Type theory

Add to Reading List

Source URL: www.cs.kent.ac.uk

Download Document from Source Website

File Size: 1,22 MB

Share Document on Facebook

Similar Documents

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¨onfinkel, 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