Pages that link to "Item:Q4939703"
From MaRDI portal
The following pages link to Type inference with simple subtypes (Q4939703):
Displaying 14 items.
- A descriptive type foundation for RDF Schema (Q739626) (← links)
- Some complexity bounds for subtype inequalities (Q1275620) (← links)
- Reduction and unification in lambda calculi with a general notion of subtype (Q1340967) (← links)
- Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
- Type inference with non-structural subtyping (Q1355750) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Transitivity in coercive subtyping (Q1776403) (← links)
- Non-structural subtype entailment in automata theory (Q1887157) (← links)
- Strong normalization with non-structural subtyping (Q4862765) (← links)
- Subtyping constrained types (Q5030204) (← links)
- Type reconstruction with recursive types and atomic subtyping (Q5044773) (← links)
- (Q5094117) (← links)
- Constraints for polymorphic behaviours of concurrent ML (Q5096301) (← links)
- Encoding natural semantics in Coq (Q5096388) (← links)