LFMTP[removed]A List-machine Benchmark for Mechanized Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt

First Page		Document Content
Date: 2006-07-19 04:40:31 Logic in computer science Type theory Deduction Automated theorem proving Formal methods Twelf Symbol Proof assistant POPLmark challenge Logic Theoretical computer science Mathematical logic		LFMTP[removed]A List-machine Benchmark for Mechanized Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt Add to Reading List Source URL: gallium.inria.fr Download Document from Source Website File Size: 209,00 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