Type Reconstruction for Type Classes

DOI10.1017/S0956796800001325MaRDI QIDQ4850163zbMATH OpenFDO

Authors Tobias Nipkow, Christian Prehofer

Publication date 9 October 1995

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

Haskellfunctional programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Polymorphic type inference with overloading and subtyping
• Principal type schemes for functional programs with overloading and subtyping
• Type classes with more higher-order polymorphism
• A theory of qualified types
• Higher-order unification, polymorphism, and subsorts

Cited in

(35)

• Kinded type inference for parametric overloading
• Type Processing by Constraint Reasoning
• scientific article; zbMATH DE number 1696585 (Why is no real title available?)
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• Hints in Unification
• A Modular Type Reconstruction Algorithm
• Lyndon words formalized in Isabelle/HOL
• Isabelle's metalogic: formalization and proof checker
• scientific article; zbMATH DE number 3881858 (Why is no real title available?)
• Type inference using constraint handling rules
• Type classes with existential types
• Implementation of Functional Languages
• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• Construction of tame types
• Qualified Types
• A theory of qualified types
• Programming Languages and Systems
• Polymorphic type inference with overloading and subtyping
• Resolving plural ambiguities by type reconstruction
• Instance chains: type class programming without overlapping instances
• Certifying dictionary construction in Isabelle/HOL
• Functional logic overloading
• Type-checking multi-parameter type classes
• A static semantics for Haskell
• Principal type schemes for functional programs with overloading and subtyping
• A formalization and proof checker for Isabelle's metalogic
• Type-safe cast (functional pearl)
• Open and closed scopes for constrained genericity
• Type classes for lightweight substructural types
• Higher-order unification, polymorphism, and subsorts
• Formal verification of algorithm \(\mathcal{W}\): the monomorphic case
• FPH: first-class polymorphism for Haskell
• Type classes with more higher-order polymorphism
• First-Class Type Classes
• A system of constructor classes: overloading and implicit higher-order polymorphism

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Type Reconstruction for Type Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850163)