First Page | Document Content | |
---|---|---|
Date: 2011-01-18 05:58:42Mathematical logic Logic Type theory Theoretical computer science Lambda calculus Dependently typed programming Proof theory Logic in computer science CurryHoward correspondence Dependent type System F Simply typed lambda calculus | Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed laAdd to Reading ListSource URL: www.cs.ru.nlDownload Document from Source WebsiteFile Size: 41,57 KBShare Document on Facebook |
Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–1472) HITCHIN TYPE MODULI STACKS IN AUTOMORPHIC REPRESENTATION THEORY Zhiwei Yun (恽之玮)DocID: 1xVTT - View Document | |
An adequacy theorem for partial type theory j.w.w. Simon Huber G¨ oteborg, May 11, 2017 An adequacy theorem for partial type theoryDocID: 1v8ox - View Document | |
E6(6) Exceptional Field Theory: Applications to Type IIB Supergravity on AdS5 ×S5 Arnaud Baguet ´ Ecole Normale Sup´DocID: 1v5Rr - View Document | |
Univalent Type Theory Thierry Coquand Tutorial for the Logic Colloquium 2016, Leeds Univalent Type TheoryDocID: 1uZ9e - 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 |