Faking it simulating dependent types in Haskell

Journal of Functional Programming

Volumn 12, Issue 4-5, 2002, Pages 375-392

  McBride, Conor ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; DATA STRUCTURES; FUNCTIONS; VECTORS;

DATATYPES;

COMPUTER PROGRAMMING;

EID: 0036059721     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004355     Document Type: Article

References (25)

1. Cayenne - A language with dependent types
2. Generalised folds for nested datatypes
3. Structured type theory
4. Do we need dependent types?
5. Type checking with universes
6. Polytypic values possess polykinded types
7. PolyP - A polytypic programming language extension
8. Type classes with functional dependencies
9. Parametric overloading in polymorphic programming languages
10. Unification under a mixed prefix
11. From fast exponentiation to square matrices: An adventure in types
12. Implementing type casses
13. Henk: A typed intermediate language
14. Type classes: An exploration of the design space
15. Dependently typed records for representing mathematical structure
16. The zip calculus
17. How to make ad-hoc polymorphism less ad hoc