<--- Back to Details
First PageDocument Content
Mathematical logic / Computability theory / Simply typed lambda calculus / Combinatory logic / Unification / Free variables and bound variables / Variable / Mathematics / Theoretical computer science / Lambda calculus
Date: 2009-07-21 10:55:57
Mathematical logic
Computability theory
Simply typed lambda calculus
Combinatory logic
Unification
Free variables and bound variables
Variable
Mathematics
Theoretical computer science
Lambda calculus

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Download Document from Source Website

File Size: 454,95 KB

Share Document on Facebook

Similar Documents

Type theory / Theoretical computer science / Mathematical logic / Programming language theory / Lambda calculus / Formal methods / Logic in computer science / CurryHoward correspondence / HindleyMilner type system / Simply typed lambda calculus / Type system / Proof assistant

PML : A new proof assistant and deduction system Christophe Raffalli LAMA

DocID: 1rnYn - View Document

Software engineering / Type theory / Computing / Programming language theory / Type system / CurryHoward correspondence / Typed lambda calculus / Simply typed lambda calculus / Type rule / Type safety / Typing environment / Go

Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch Ben Hardekopf

DocID: 1rgc6 - View Document

Theoretical computer science / Mathematical logic / Computer science / Logic in computer science / Lambda calculus / Models of computation / Proof theory / Computability theory / Simply typed lambda calculus / Natural deduction / CurryHoward correspondence

An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard Contents

DocID: 1rabj - View Document

Mathematical logic / Logic / Type theory / Theoretical computer science / Lambda calculus / Dependently typed programming / Proof theory / Logic in computer science / CurryHoward correspondence / Dependent type / System F / Simply typed lambda calculus

Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

DocID: 1ra6V - View Document

Computability theory / Lambda calculus / Theoretical computer science / Computer science / Mathematics / Academia / Proof theory

Chapter 3 Simple Types We study simple types in this chapter, We first formalize a simply-typed programming language L0 and then establish its type soundness, setting some machinery for development in the following chap

DocID: 1r0ej - View Document