<--- Back to Details
First PageDocument Content
Software engineering / Software / Type theory / Programming language theory / Proof assistants / Functional languages / Formal methods / Logic in computer science / Formal verification / Dependent type / Agda / Coq
Date: 2015-11-12 17:02:31
Software engineering
Software
Type theory
Programming language theory
Proof assistants
Functional languages
Formal methods
Logic in computer science
Formal verification
Dependent type
Agda
Coq

bイオウウ・ャウL@SP@o」エッ「・イ@RPQU cost@PUUOQU decision sオ「ェ・」エZ@

Add to Reading List

Source URL: w3.cost.eu

Download Document from Source Website

File Size: 1,27 MB

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