First Page | Document Content | |
---|---|---|
![]() Date: 2013-02-05 11:53:37Lambda 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 | Add to Reading List |
![]() | Dependent Object Types Towards a foundation for Scala’s type system Nada Amin Adriaan MoorsDocID: 1xVKz - View Document |
![]() | Type Soundness for Dependent Object Types (DOT) * Complete We sisDocID: 1xUdC - View Document |
![]() | Type Soundness for DOT (Dependent Object Types) Tiark Rompf Nada AminDocID: 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 |