The following pages link to (Q3889024):
Displayed 16 items.
- Representing model theory in a type-theoretical logical framework (Q654913) (← links)
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics (Q865658) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Abstract data type systems (Q1391729) (← links)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
- Typing correspondence assertions for communication protocols (Q1399972) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Quantum computation with programmable connections between gates (Q2376283) (← links)
- CPO-models for second order lambda calculus with recursive types and subtyping (Q3142273) (← links)
- Hyperformulae, Parallel Deductions and Intersection Types (Q4916178) (← links)
- Typing Correspondence Assertions for Communication Protocols (Q4917053) (← links)
- Remarks on Isomorphisms of Simple Inductive Types (Q4924549) (← links)
- Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
- A short and flexible proof of strong normalization for the calculus of constructions (Q6083893) (← links)