Sound and Decidable Type Inference for Functional Dependencies

Sound and Decidable Type Inference for Functional Dependencies (2004)

by Gregory J. Duck , Simon Peyton-Jones , Peter J. Stuckey , Martin Sulzmann

Citations:

30 - 14 self

User correction supplied by mph

Datum	Value	Source
TITLE	Sound and Decidable Type Inference for Functional Dependencies	user correction - Legacy Corrections
AUTHOR NAME	Gregory J. Duck	user correction
AUTHOR NAME	Simon Peyton-Jones	user correction
AUTHOR NAME	Peter J. Stuckey	user correction
AUTHOR NAME	Martin Sulzmann	user correction
AUTHOR AFFIL	Department of Computer Science and Software Engineering; The University of Melbourne; 2; Microsoft Research Ltd; 7 JJ Thomson Avenue; 3; School of Computing, National University of Singapore	user correction
AUTHOR ADDR	; Vic. 3010, Australia; Cambridge CB3 0FB, England; S16 Level 5, 3 Science Drive 2, Singapore 117543	user correction
ABSTRACT	Functional dependencies are a popular and useful extension to Haskell style type classes. In this paper, we give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous work, CHRs have been employed for describing user-programmable type extensions in the context of Haskell style type classes. Here, we make use of CHRs to provide for the first time a concise result that under some sufficient conditions, functional dependencies allow for sound and decidable type inference. The sucient conditions imposed on functional dependencies can be very limiting. We show how to safely relax these conditions.	user correction
YEAR	2004	user correction - Legacy Corrections
CITATIONS	14 found	ParsCit 1.0