Faking it Simulating dependent types in Haskell

Authors:
Conor McBride
Affiliations:
Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham DH1 3LE, UK (e-mail: c.t.mcbride@durham.ac.uk)
Venue:
Journal of Functional Programming
Year:
2002

Citing 13
Cited 38

How to make ad-hoc polymorphism less ad hoc

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type checking with universes

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Unification under a mixed prefix

Journal of Symbolic Computation
Implementing type classes

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Computation and reasoning: a type theory for computer science

Computation and reasoning: a type theory for computer science
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
From fast exponentiation to square matrices: an adventure in types

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Proceedings of the 5th International Conference on Mathematics of Program Construction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Parametric Overloading in Polymorphic Programming Languages

ESOP '88 Proceedings of the 2nd European Symposium on Programming
Polytypic Values Possess Polykinded Types

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
The Zip Calculus

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Do we need dependent types?

Journal of Functional Programming

An Introduction to Dependent Type Theory

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Modeling quantum computing in Haskell

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Formatting: a class act

Journal of Functional Programming
Functional pearl: implicit configurations--or, type classes reflect the values of types

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Strongly typed heterogeneous collections

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Combining programming with theorem proving

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Strong types for relational databases

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Polymorphic variants in Haskell

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Software extension and integration with type classes

Proceedings of the 5th international conference on Generative programming and component engineering
Scrap your boilerplate with XPath-like combinators

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Iteration and coiteration schemes for higher-order and nested datatypes

Theoretical Computer Science - Foundations of software science and computation structures
A history of Haskell: being lazy with class

Proceedings of the third ACM SIGPLAN conference on History of programming languages
Lightweight Static Capabilities

Electronic Notes in Theoretical Computer Science (ENTCS)
A type-level approach to component prototyping

International workshop on Synthesis and analysis of component connectors: in conjunction with the 6th ESEC/FSE joint meeting
Clowns to the left of me, jokers to the right (pearl): dissecting data structures

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Experience report: visualizing data through functional pipelines

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Many holes in hindley-milner

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Compositional reasoning and decidable checking for dependent contract types

Proceedings of the 3rd workshop on Programming languages meets program verification
Practical Variable-Arity Polymorphism

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Initial Algebra Semantics for Cyclic Sharing Structures

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Attribute grammars fly first-class: how to do aspect oriented programming in Haskell

Proceedings of the 14th 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
Well-going programs can be typed

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Type classes as objects and implicits

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
A Tutorial Implementation of a Dependently Typed Lambda Calculus

Fundamenta Informaticae - Dependently Typed Programming
Embedding a proof system in haskell

CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
On the bright side of type classes: instance arguments in Agda

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Monad factory: type-indexed monads

TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Epigram: practical programming with dependent types

AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Dependently typed programming with singletons

Proceedings of the 2012 Haskell Symposium
Deconstraining DSLs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Generic programming with dependent types

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Attribute grammar macros

SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Fixing idioms: a recursion primitive for applicative DSLs

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
UUAG meets AspectAG: how to make attribute grammars first-class

Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and Applications
Programming errors in traversal programs over structured data

Science of Computer Programming
Closed type families with overlapping equations

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
EsseOS: Haskell-based tailored services for the cloud

Proceedings of the 12th International Workshop on Adaptive and Reflective Middleware

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may simulate some aspects of dependent typing by making counterfeit type-level copies of data, with type constructors simulating data constructors and type classes simulating datatypes. This paper gives examples of the technique and discusses its potential.