Pages that link to "Item:Q4276174"
From MaRDI portal
The following pages link to A Complete Proof Synthesis Method for the Cube of Type Systems (Q4276174):
Displaying 13 items.
- The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Automated proof construction in type theory using resolution (Q1868508) (← links)
- Automorphisms of types and their applications (Q2307975) (← links)
- Prototype proofs in type theory (Q4487253) (← links)
- Proof search with set variable instantiation in the Calculus of Constructions (Q4647555) (← links)
- An algorithm for checking incomplete proof objects in type theory with localization and unification (Q4647580) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- Cartesian cubical computational type theory: Constructive reasoning with paths and equalities (Q5079726) (← links)
- Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic (Q5369477) (← links)
- Proof-term synthesis on dependent-type systems via explicit substitutions (Q5958764) (← links)