Type inference with simple subtypes
From MaRDI portal
Cites work
- A filter lambda model and the completeness of type assignment
- A Machine-Oriented Logic Based on the Resolution Principle
- A semantics of multiple inheritance
- An ideal model for recursive polymorphic types
- Curry's type-rules are complete with respect to the F-semantics too
- Data Types as Lattices
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- On the semantics of polymorphism
- On the sequential nature of unification
- Polymorphic type inference and containment
- The Category-Theoretic Solution of Recursive Domain Equations
- The completeness theorem for typing lambda-terms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Principal Type-Scheme of an Object in Combinatory Logic
- What is a model of the lambda calculus?
Cited in
(14)- Some complexity bounds for subtype inequalities
- Reduction and unification in lambda calculi with a general notion of subtype
- Strong normalization for non-structural subtyping via saturated sets
- Type inference with non-structural subtyping
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Transitivity in coercive subtyping
- Non-structural subtype entailment in automata theory
- Strong normalization with non-structural subtyping
- Subtyping constrained types
- Type reconstruction with recursive types and atomic subtyping
- A tier-based typed programming language characterizing feasible functionals
- Constraints for polymorphic behaviours of concurrent ML
- Encoding natural semantics in Coq
- A descriptive type foundation for RDF Schema
This page was built for publication: Type inference with simple subtypes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939703)
