The following pages link to Do-it-yourself type theory (Q911744):
Displaying 24 items.
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Propositions and specifications of programs in Martin-Löf's type theory (Q800719) (← links)
- Normalising the associative law: An experiment with Martin-Löf's type theory (Q809071) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Constructing recursion operators in intuitionistic type theory (Q1094421) (← links)
- Derivation of a parsing algorithm in Martin-Löf's theory of types (Q1097045) (← links)
- An intuitionistic theory of types with assumptions of high-arity variables (Q1192333) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Paramorphisms (Q1201295) (← links)
- Constructing a theory of a data structure as an aid to program development (Q1247742) (← links)
- Inductive families (Q1336951) (← links)
- A cartesian closed category in Martin-Löf's intuitionistic type theory (Q1853587) (← links)
- Semantics of under-determined expressions (Q1911315) (← links)
- Type theory should eat itself (Q2804938) (← links)
- Proof theory and computer programming (Q3032255) (← links)
- Abstract Data Types and Type Theory: Theories as Types (Q3479540) (← links)
- A While-rule in Martin-Lof's Theory of Types (Q3778750) (← links)
- Introducing data types in intuitionistic type theory (Q3989761) (← links)
- Program specification and data refinement in type theory (Q4282807) (← links)
- Tychonoff's theorem in the framework of formal topologies (Q4382478) (← links)
- Formalizing Type Operations Using the “Image” Type Constructor (Q4917993) (← links)
- Applications of type theory (Q5044747) (← links)
- ETA-RULES IN MARTIN-LÖF TYPE THEORY (Q5240810) (← links)
- MARTIN-LÖF'S TYPE THEORY AS AN OPEN-ENDED FRAMEWORK (Q5249247) (← links)
