Sciweavers

439 search results - page 8 / 88
» Type invariants for Haskell
Sort
View
ESOP
2006
Springer
14 years 20 days ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
HASKELL
2009
ACM
14 years 3 months ago
Type-safe observable sharing in Haskell
Haskell is a great language for writing and supporting embedded Domain Specific Languages (DSLs). Some form of observable sharing is often a critical capability for allowing so-c...
Andy Gill
JFP
2007
136views more  JFP 2007»
13 years 9 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
HASKELL
2008
ACM
13 years 10 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
HASKELL
2006
ACM
14 years 3 months ago
An extensible dynamically-typed hierarchy of exceptions
In this paper we address the lack of extensibility of the exception type in Haskell. We propose a lightweight solution involving the use of existential types and the Typeable clas...
Simon Marlow