It is Time to Mechanize Programming Language Metatheory? Benjamin C. Pierce1 , Peter Sewell2 , Stephanie Weirich1 , and Steve Zdancewic1 1 Department of Computer and Information Science, University of Pennsylvania

First Page		Document Content
Date: 2005-10-11 03:37:08 Formal methods Automated theorem proving Logic in computer science POPLmark challenge Programming language theory Formal sciences QED manifesto Nqthm Theoretical computer science Mathematics Logic		It is Time to Mechanize Programming Language Metatheory? Benjamin C. Pierce1 , Peter Sewell2 , Stephanie Weirich1 , and Steve Zdancewic1 1 Department of Computer and Information Science, University of Pennsylvania Add to Reading List Source URL: vstte.ethz.ch Download Document from Source Website File Size: 112,07 KB Share Document on Facebook

	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨ DocID: 1reYE - View Document
	The 2006 Federated Logic Conference The Seattle Sheraton Hotel and Towers Seattle, Washington August, 2006 IJCAR Workshop DocID: 1oIBk - View Document
	Can the computer really help us to prove theorems? DocID: 1lK2e - View Document
	CLASE 2005 Preliminary Version Constructing Induction Rules for Deductive Synthesis Proofs Alan Bundy† 1,2 Lucas Dixon† 3 Jeremy Gow‡ 4 Jacques Fleuriot† 5 DocID: 1kPXX - View Document
	RAC Rev. R. Acad. Cien. Serie A. Mat. VOL), 2004, pp. 153–180 Ciencias de la Computaci´on / Computational Sciences DocID: 1kPRp - View Document