Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

First Page		Document Content
Date: 2017-09-21 08:25:51 Software engineering Computer programming Computing Functional languages Data types Type theory Logic in computer science Automated theorem proving OCaml Coq Disjoint-set data structure Proof assistant		Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits Add to Reading List Source URL: chargueraud.org Download Document from Source Website File Size: 372,81 KB Share 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 theory DocID: 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 Theory DocID: 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