The following pages link to JProver (Q21955):
Displaying 13 items.
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- The ILTP problem library for intuitionistic logic (Q877897) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- A matrix characterization for multiplicative exponential linear logic (Q1876098) (← links)
- Certification of nonclausal connection tableaux proofs (Q2180504) (← links)
- Theorem prover for intuitionistic logic based on the inverse method (Q2216868) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
- Building reliable, high-performance networks with the Nuprl proof development system (Q4819652) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479281) (← links)
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings (Q5941850) (← links)
