<--- Back to Details
First PageDocument Content
Lambda calculus / Mathematical logic / Logic in computer science / Dependently typed programming / Theory of computation / Normalisation by evaluation / Simply typed lambda calculus / Typed lambda calculus / Dependent type / Type theory / Programming language theory / Theoretical computer science
Date: 2013-02-05 11:53:37
Lambda calculus
Mathematical logic
Logic in computer science
Dependently typed programming
Theory of computation
Normalisation by evaluation
Simply typed lambda calculus
Typed lambda calculus
Dependent type
Type theory
Programming language theory
Theoretical computer science

Habilitationsschrift Normalization by Evaluation

Add to Reading List

Source URL: www2.tcs.ifi.lmu.de

Download Document from Source Website

File Size: 1.021,04 KB

Share Document on Facebook

Similar Documents

Proof theory / General relativity / Complex analysis / Holomorphic functional calculus

Dependent Object Types Towards a foundation for Scala’s type system Nada Amin Adriaan Moors

DocID: 1xVKz - View Document

Software engineering / Computing / Type theory / Computer programming / Object-oriented programming / Data types / Polymorphism / Functional programming / Subtyping / Covariance and contravariance / Natural deduction / Bottom type

Type Soundness for Dependent Object Types (DOT) * Complete We sis

DocID: 1xUdC - View Document

Computing / Software engineering / Computer programming / Type theory / Data types / Functional languages / Subroutines / Scala / Recursive data type / Recursion / Type system

Type Soundness for DOT (Dependent Object Types) Tiark Rompf Nada Amin

DocID: 1xTuC - View Document

Syntax for dependent type theories Nicola Gambino Leeds, February 20th, 2013 First-order theories vs dependent type theories (I)

DocID: 1v5Yu - View Document

Collection Principles in Dependent Type Theory? Peter Aczel1 and Nicola Gambino2 1 Departments of Mathematics and Computer Science, University of Manchester,

DocID: 1uXqs - View Document