Closed type families with overlapping equations

Authors:
Richard A. Eisenberg;Dimitrios Vytiniotis;Simon Peyton Jones;Stephanie Weirich
Affiliations:
University of Pennsylvania, Philadelphia, PA, USA;Microsoft Research Cambridge, Cambridge, United Kingdom;Microsoft Research Cambridge, Cambridge, United Kingdom;University of Pennsylvania, Philadelphia, PA, USA
Venue:
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Year:
2014

Citing 18
Cited 0

Unification: a multidisciplinary survey

ACM Computing Surveys (CSUR)
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A comparative study of language support for generic programming

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Do we need dependent types?

Journal of Functional Programming
Faking it Simulating dependent types in Haskell

Journal of Functional Programming
Strongly typed heterogeneous collections

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
System F with type equality coercions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Understanding functional dependencies via constraint handling rules

Journal of Functional Programming
Data types à la carte

Journal of Functional Programming
Type checking with open type functions

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Arity-generic datatype-generic programming

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Instance chains: type class programming without overlapping instances

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Generative type abstraction and type-level computation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Giving Haskell a promotion

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
System FC with explicit kind equality

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Open, type-level functions are a recent innovation in Haskell that move Haskell towards the expressiveness of dependent types, while retaining the look and feel of a practical programming language. This paper shows how to increase expressiveness still further, by adding closed type functions whose equations may overlap, and may have non-linear patterns over an open type universe. Although practically useful and simple to implement, these features go beyond conventional dependent type theory in some respects, and have a subtle metatheory.