Pages that link to "Item:Q365669"
From MaRDI portal
The following pages link to A decidable theory of type assignment (Q365669):
Displaying 9 items.
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- The insensitivity theorem for nonreducing reflexive types (Q792755) (← links)
- A simple proof of a theorem of Statman (Q1199546) (← links)
- Threshold voting leads to type-revelation (Q1667910) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- A New Type Assignment for Strongly Normalizable Terms (Q2958549) (← links)
- Decidability in Intuitionistic Type Theory is Functionally Decidable (Q4888341) (← links)
- Computer Science Logic (Q5311257) (← links)