Sciweavers

439 search results - page 10 / 88
» Type invariants for Haskell
Sort
View
HASKELL
2005
ACM
14 years 2 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons
HASKELL
2008
ACM
13 years 10 months ago
Language and program design for functional dependencies
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
Mark P. Jones, Iavor S. Diatchki
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 2 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
HASKELL
2009
ACM
14 years 3 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
DLS
2005
148views Languages» more  DLS 2005»
13 years 11 months ago
Compile-time meta-programming in a dynamically typed OO language
Compile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages ar...
Laurence Tratt