Sciweavers

439 search results - page 11 / 88
» Type invariants for Haskell
Sort
View
HASKELL
2007
ACM
14 years 26 days ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
APLAS
2003
ACM
14 years 2 months ago
Scrap Your Boilerplate
This paper introduces a Standard ML realization of the scrap-yourboilerplate generic-programming mechanism (first introduced by Simon Peyton Jones and Ralf Lämmel), which gives ...
Simon L. Peyton Jones, Ralf Lämmel
POPL
1993
ACM
14 years 1 months ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer
HASKELL
2006
ACM
14 years 3 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
PADL
2007
Springer
14 years 3 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy