Pages that link to "Item:Q5200015"
From MaRDI portal
The following pages link to The Matita Interactive Theorem Prover (Q5200015):
Displaying 21 items.
- Matita (Q18274) (← links)
- Reverse complexity (Q287279) (← links)
- Recycling proof patterns in Coq: case studies (Q475385) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- From types to sets by local type definition in higher-order logic (Q1722645) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- From Types to Sets by Local Type Definitions in Higher-Order Logic (Q2829259) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Friends with Benefits (Q2988636) (← links)
- On Choice Rules in Dependent Type Theory (Q2988806) (← links)
- The Lean Theorem Prover (System Description) (Q3454108) (← links)
- Natural Deduction Environment for Matita (Q3637307) (← links)
- A Certified Study of a Reversible Programming Language (Q4580228) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)
- Validating Mathematical Structures (Q5048998) (← links)
- Programming and Proving with Classical Types (Q5055999) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- Pure type systems with explicit substitutions (Q5371956) (← links)
- (Q5875441) (← links)
