
Conferences in DBLP
 Ricky W. Butler
Formal Methods at NASA Langley. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:12 [Conf]
 Gérard P. Huet
Higher Order Unification 30 Years Later. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:312 [Conf]
 Simon Ambler, Roy L. Crole, Alberto Momigliano
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:1330 [Conf]
 Gilles Barthe, Pierre Courtieu
Efficient Reasoning about Executable Specifications in Coq. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:3146 [Conf]
 David A. Basin, Stefan Friedrich, Marek Gawkowski
Verified Bytecode Model Checkers. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:4766 [Conf]
 Gertrud Bauer, Tobias Nipkow
The 5 Colour Theorem in Isabelle/Isar. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:6782 [Conf]
 Yves Bertot, Venanzio Capretta, Kuntal Das Barman
TypeTheoretic Functional Semantics. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:8398 [Conf]
 Achim D. Brucker, Burkhart Wolff
A Proposal for a Formal OCL Semantics in Isabelle/HOL. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:99114 [Conf]
 Judicaël Courant
Explicit Universes for the Calculus of Constructions. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:115130 [Conf]
 Jeremy E. Dawson, Rajeev Goré
Formalised Cut Admissibility for Display Logic. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:131147 [Conf]
 Christophe Dehlinger, JeanFrançois Dufourd
Formalizing the Trading Theorem for the Classification of Surfaces. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:148163 [Conf]
 David Delahaye
FreeStyle Theorem Proving. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:164181 [Conf]
 Louise A. Dennis, Alan Bundy
A Comparison of Two Proof Critics: Power vs. Robustness. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:182197 [Conf]
 Amy P. Felty
TwoLevel Metareasoning in Coq. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:198213 [Conf]
 Michael J. C. Gordon
PuzzleTool : An Example of Programming Computation and Deduction. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:214229 [Conf]
 Joe Hurd
A Formal Approach to Probabilistic Termination. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:230245 [Conf]
 Micaela Mayero
Using Theorem Proving for Numerical Analysis (Correctness Proof of an Automatic Differentiation Algorithm). [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:246262 [Conf]
 Aleksey Nogin
Quotient Types: A Modular Approach. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:263280 [Conf]
 Aleksey Nogin, Jason Hickey
Sequent Schema for Derived Rules. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:281297 [Conf]
 Virgile Prevosto, Damien Doligez, Thérèse Hardin
Algebraic Structures and Dependent Records. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:298313 [Conf]
 Klaus Schneider
Proving the Equivalence of Microstep and Macrostep Semantics. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:314331 [Conf]
 Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
Weakest Precondition for General Recursive Programs Formalized in Coq. [Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:332348 [Conf]
