Automated theorem proving - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2010-10-29 12:59:28 Applied mathematics Logic in computer science Dependently typed programming Type theory Automated theorem proving Proof-carrying code Formal verification Automated proof checking Frank Pfenning Formal methods Theoretical computer science Mathematics		Add to Reading List Source URL: www.cs.berkeley.edu Download Document from Source Website File Size: 1,57 MB Share Document on Facebook

	Eliminating Array Bound Checking Through Dependent Types* Frank Pfenning Department of Computer Science Carnegie Mellon University DocID: 1u6lq - View Document
	On the Undecidability of Partial Polymorphic Type Reconstruction Frank Pfenning January 1992 CMU-CS DocID: 1topc - View Document
	Invited talk at TLDI’12 Towards Concurrent Type Theory Lu´ıs Caires Frank Pfenning DocID: 1tjlN - View Document
	Lecture Notes on AVL Trees: Principles of Imperative Computation Frank Pfenning Lecture 18 March 22, 2011 DocID: 1tgz8 - View Document