Knowledge Base of
Publications,
Seminars,
& 
Math Library
PhD theses from the project are accessible at the NCSTRL web site.
Filter for: Abhishek Anand
12 results
From Replicated Databases to Ensembles of Collaborating Robots
by Abhishek Anand, Mark Bickford
November 19, 2014
Coinduction in Coq
by Abhishek Anand
November 12, 2014
Topics in Type Theory
by Abhishek Anand, Robert L. Constable, Mark Bickford
October 22, 2014
A Generic Approach to Proofs about Substitution
by Abhishek Anand, Vincent Rahli
July 17, 2014
Towards a Formally Verified Proof Assistant
by Abhishek Anand, Vincent Rahli
July 14, 2014
A Type Theory with Partial Equivalence Relations as Types
by Abhishek Anand, Mark Bickford, Robert L. Constable, Vincent Rahli
May 12, 2014
How far can we go with Induction-Recursion?
by Abhishek Anand, Vincent Rahli
November 20, 2013
A verified proof assistant
by Vincent Rahli, Abhishek Anand
October 30, 2013
The Beauty of Nuprl's Uniform Term Representation and How to Reason about those Terms in Coq
by Abhishek Anand
October 09, 2013
Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types
| cite »
by Vincent Rahli, Mark Bickford, Abhishek Anand
April 22, 2013
Bar Induction and the Fan Theorem in Constructive Type Theory
by Robert L. Constable, Mark Bickford, Abhishek Anand
October 12, 2012
The Type Base and Undecidability in Type Theory
by Abhishek Anand
September 21, 2012