First Page | Document Content | |
---|---|---|
Date: 2018-10-11 10:56:59Software engineering Computer programming Computing Functional programming Logic in computer science Functional languages Formal methods Type theory Monad F* Predicate transformer semantics Haskell | The Formal Semantics and Evolution of the F? Verification System October 11, Relational reasoning in F? : devising scalable verification techniques for properties of multiple program executions (e.g., confidentiaAdd to Reading ListSource URL: prosecco.gforge.inria.frDownload Document from Source WebsiteFile Size: 123,11 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 |