First Page | Document Content | |
---|---|---|
Date: 2015-11-12 17:02:31Software 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 ListSource URL: w3.cost.euDownload Document from Source WebsiteFile Size: 1,27 MBShare Document on Facebook |
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 |