2394 search results - page 63 / 479 » Implementing Mobile Haskell |
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
ICFP
2003
ACM
14 years 9 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
ICFP
2002
ACM
14 years 9 months ago
2002
ACM
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
ICFP
2002
ACM
14 years 9 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
PEPM
2010
ACM
14 years 5 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...