<scp>OutsideIn(X)</scp>Modular type inference with local assumptions

DOI10.1017/S0956796811000098zbMath1262.68034MaRDI QIDQ4918240

Martin Sulzmann, Tom Schrijvers, Dimitrios Vytiniotis, Simon L. Peyton Jones

Publication date: 24 April 2013

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

zbMATH Keywords

constraint-based type inferenceconstraint solver

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Related Items (10)

Modular Inference of Linear Types for Multiplicity-Annotated Arrows ⋮ Safe zero-cost coercions for Haskell ⋮ Migrating gradual types ⋮ Ambivalent Types for Principal Type Inference with GADTs ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ Unnamed Item ⋮ Idris, a general-purpose dependently typed programming language: Design and implementation ⋮ Skalpel: a constraint-based type error slicer for standard ML ⋮ Visible Type Application ⋮ COCHIS: Stable and coherent implicits

Uses Software

• Haskell

Cites Work

• Type inference for polymorphic references
• A theory of type polymorphism in programming
• Scrap your boilerplate with class
• Associated type synonyms
• Guarded recursive datatype constructors
• Practical type inference for arbitrary-rank types
• Understanding functional dependencies via constraint handling rules
• A Framework for Extended Algebraic Data Types
• Theory and practice of constraint handling rules
• Theorem proving using equational matings and rigid E -unification
• Shostak's congruence closure as completion
• Type Reconstruction for Type Classes
• Type checking with open type functions
• Principal Type Inference for GHC-Style Multi-parameter Type Classes

This page was built for publication: <scp>OutsideIn(X)</scp>Modular type inference with local assumptions