James Caldwell Department of Computer Science University of Wyoming Laramie, WYDATE: October 31, 2016

First Page		Document Content
Date: 2016-10-31 17:07:05 Automated theorem proving Theoretical computer science Computing Mathematics Nuprl Interactive Theorem Proving Proof assistant Robert Lee Constable ACL2 Formal methods Computer science Automated reasoning		James Caldwell Department of Computer Science University of Wyoming Laramie, WYDATE: October 31, 2016 Add to Reading List Source URL: www.cs.uwyo.edu Download Document from Source Website File Size: 124,95 KB Share Document on Facebook

	Reflecting Higher-Order Abstract Syntax in Nuprl? Eli Barzilay and Stuart Allen Cornell University {eli,sfa}@cs.cornell.edu Abstract. This document describes part of an effort to achieve in Nuprl a practical reflection o DocID: 1uwcL - View Document
	A Model of Cubical Type Theory in Nuprl Mark Bickford Cornell University, Computer Science July 13, 2016 DocID: 1t5In - View Document
	Intuitionistic Completeness of First-Order Logic Robert Constable and Mark Bickford October 7, 2011 Abstract We establish completeness for intuitionistic first-order logic, iFOL, showing that is a formula DocID: 1sYMZ - View Document
	Exploiting Uniformity in Substitution: the Nuprl Term Model Abhishek Anand DocID: 1sSlk - View Document