88 search results - page 1 / 18 » Nominal Reasoning Techniques in Coq: (Extended Abstract) |
ENTCS
2007
13 years 5 months ago
2007
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
FLOPS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
TPHOL
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
JAPLL
2007
13 years 5 months ago
2007
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...