Hierarchy Builder - Algebraic hierarchies Made Easy in Coq with Elpi (System Description). | 0 | 0.34 | 2020 |
Implementing Type Theory in Higher Order Constraint Logic Programming | 1 | 0.35 | 2019 |
Implementing HOL in an Higher Order Logic Programming Language. | 2 | 0.38 | 2016 |
ELPI: Fast, Embeddable, \lambda Prolog Interpreter. | 7 | 0.42 | 2015 |
A machine-checked proof of the odd order theorem | 80 | 3.41 | 2013 |
Canonical structures for the working coq user | 12 | 0.70 | 2013 |
Pervasive parallelism in highly-trustable interactive theorem proving systems | 1 | 0.39 | 2013 |
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions | 14 | 0.77 | 2012 |
A Language of Patterns for Subterm Selection. | 2 | 0.38 | 2012 |
Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover. | 3 | 0.44 | 2012 |
The Matita interactive theorem prover | 31 | 1.57 | 2011 |
Formalising Overlap Algebras in Matita. | 3 | 0.41 | 2011 |
Regular Expressions, au point | 2 | 0.36 | 2010 |
Superposition As A Logical Glue | 2 | 0.40 | 2009 |
Natural Deduction Environment for Matita | 0 | 0.34 | 2009 |
Hints in Unification | 22 | 1.05 | 2009 |
An Interactive Driver for Goal-directed Proof Strategies | 3 | 0.45 | 2009 |
Nonuniform Coercions Via Unification Hints | 3 | 0.40 | 2009 |
A Constructive And Formal Proof Of Lebesgue'S Dominated Convergence Theorem In The Interactive Theorem Prover Matita | 4 | 0.53 | 2008 |
Working with mathematical structures in type theory | 10 | 0.82 | 2007 |
Tinycals: Step by Step Tacticals | 13 | 0.78 | 2007 |
A modular formalisation of finite group theory | 33 | 1.83 | 2007 |
User Interaction with the Matita Proof Assistant | 48 | 2.79 | 2007 |
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case | 6 | 0.45 | 2007 |
A content based mathematical search engine: whelp | 25 | 1.69 | 2004 |
Event indexing systems for efficient selection and analysis of HERA data | 0 | 0.34 | 2001 |