Type inference in polymorphic type discipline
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- A type inference algorithm for a stratified polymorphic type discipline
- scientific article; zbMATH DE number 4180772 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- Modified basic functionality in combinatory logic
- On the logic of unification
- Polymorphic type inference and containment
- Principal type scheme and unification for intersection type discipline
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Principal Type-Scheme of an Object in Combinatory Logic
Cited in
(32)- Polymorphic type inference and containment
- Type reconstruction in finite rank fragments of the second-order -calculus
- Type inference for pure type systems
- Typability and type checking in System F are equivalent and undecidable
- A type inference algorithm for a stratified polymorphic type discipline
- A semantics for static type inference
- Type inference with non-structural subtyping
- Type soundness for path polymorphism
- Explaining type inference
- scientific article; zbMATH DE number 1638659 (Why is no real title available?)
- Symbolic abstract data type inference
- Polar type inference with intersection types and
- scientific article; zbMATH DE number 3881858 (Why is no real title available?)
- scientific article; zbMATH DE number 3898200 (Why is no real title available?)
- scientific article; zbMATH DE number 3930968 (Why is no real title available?)
- scientific article; zbMATH DE number 4051569 (Why is no real title available?)
- scientific article; zbMATH DE number 177779 (Why is no real title available?)
- scientific article; zbMATH DE number 1948390 (Why is no real title available?)
- scientific article; zbMATH DE number 1953289 (Why is no real title available?)
- scientific article; zbMATH DE number 1487941 (Why is no real title available?)
- Inferring program specifications in polynomial-time
- scientific article; zbMATH DE number 7577586 (Why is no real title available?)
- Type Inference for Correspondence Types
- Intensional polymorphism in type-erasure semantics
- Basic polymorphic typechecking
- Typed equivalence, type assignment, and type containment
- Programming Languages and Systems
- Type inference for hierarchical multiset structures in rule-based systems
- Polymorphic type inference for the relational algebra
- Type inference with subtypes
- Type inference for polymorphic references
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
This page was built for publication: Type inference in polymorphic type discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096210)