<--- Back to Details
First PageDocument Content
Type theory / Functional languages / Data types / Agda / Haskell / Functional programming / Dependent type / Pattern matching / Type system / Software engineering / Computing / Programming language theory
Date: 2014-01-24 04:21:13
Type theory
Functional languages
Data types
Agda
Haskell
Functional programming
Dependent type
Pattern matching
Type system
Software engineering
Computing
Programming language theory

Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik III

Add to Reading List

Source URL: www.iai.uni-bonn.de

Download Document from Source Website

File Size: 616,48 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