|
46
|
Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
- 1995
|
|
301
|
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
– John Mccarthy
- 1960
|
|
228
|
Computer-Aided Reasoning: An Approach
– M Kaufmann, P Manolios, J S Moore
- 2000
|
|
186
|
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant
– Xavier Leroy
- 2006
|
|
292
|
Theorems for free!
– Philip Wadler
- 1989
|
|
7
|
A mechanically verified, sound and complete theorem prover for first order logic
– Tom Ridge, James Margetson
- 2005
|
|
12
|
Faster Proof Checking in the Edinburgh Logical Framework
– Aaron Stump, David L. Dill
- 2002
|
|
2
|
The HOL Light System Reference
– J Harrison
|
|
580
|
Types and Programming Languages
– B C Pierce
- 2002
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
54
|
Formal verification of a C compiler front-end
– Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
- 2006
|
|
5
|
Free variable types
– Edwin Westbrook
- 2006
|
|
110
|
Mechanized metatheory for the masses: The POPLmark challenge
– Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Stephanie Weirich, Steve Zdancewic
- 2005
|
|
18
|
The Theory of Fexprs is Trivial
– Mitchell Wand
- 1998
|
|
3
|
buchberger’s phd thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
– Bruno
- 2006
|
|
1
|
Jérôme Créci. Gb: une procédure de décision pour le système coq
– Loïc Pottier
- 2004
|
|
1
|
9 Gröbner bases programs with Coq Pottier
– Gb http fgbrs lip6 frjcfSoftwareGbindex html
|
|
4
|
Automating elementary number-theoretic proofs using Gröbner bases
– John Harrison
|
|
1092
|
Commutative algebra with a view towards algebraic geometry
– D Eisenbud
- 1995
|
