First Page | Document Content | |
---|---|---|
Date: 2009-04-02 18:22:28Functional languages Type theory Automated theorem proving Hybrid automaton Numerical analysis Proof assistant Coq Verification OCaml Model checking Discretization | Verification of Hybrid Systems in Coq H. Geuvers, A. Koprowski, D. Synek, E. van der Weegen BRICKS AFM4 Advancing the Real use of Proof Assistants Foundations group, Intelligent Systems, ICIS Radboud University NijmegenAdd to Reading ListSource URL: www.cs.ru.nlDownload Document from Source WebsiteFile Size: 1,65 MBShare 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 |