Cited in
(62)- Hammering towards QED
- Classification of alignments between concepts of formal mathematical systems
- Mining the Archive of Formal Proofs
- A Modular Type Reconstruction Algorithm
- JEFL: joint embedding of formal proof libraries
- Aligning concepts across proof assistant libraries
- Making PVS accessible to generic services by interpretation in a universal format
- Developing corpus-based translation methods between informal and formal mathematics: project description
- Robinson arithmetic
- Machine learning guidance for connection tableaux
- Theorem proving as constraint solving with coherent logic
- MizAR 40 for Mizar 40
- MPTP
- gensim
- MoMM
- Sledgehammer
- MMT
- QMT
- Polar
- MaSh
- Flyspeck
- PRocH
- GQML
- AgsyHOL
- HOT
- Beagle
- SigmaKEE
- BliStr
- System description: E.T. 0.1
- DISCOUNT
- LATIN
- LLFp
- FMLtoHOL
- SRASS
- vis.js
- Proofwatch
- Jinja not Java
- CoqHammer
- VerifyThis
- Holophrasm
- OpenTheory
- Zipperposition
- Whelp
- Making higher-order superposition work
- Superposition with lambdas
- Matching concepts across HOL libraries
- An abstraction-refinement framework for reasoning with large theories
- Superposition with lambdas
- EUCLID
- Sharing HOL4 and HOL Light proof knowledge
- Higher-order modal logics: automation and applications
- Experiences from exporting major proof assistant libraries
- A learning-based fact selector for Isabelle/HOL
- Learning-assisted theorem proving with millions of lemmas
- Hammer for Coq: automation for dependent type theory
- HOL(y)Hammer: online ATP service for HOL Light
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
- Random forests for premise selection
- Formalizing physics: automation, presentation and foundation issues
- Making higher-order superposition work
- A formally verified abstract account of Gödel's incompleteness theorems
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
This page was built for software: HOLyHammer
