Sciweavers

439 search results - page 14 / 88
» Type invariants for Haskell
Sort
View
ICFP
2002
ACM
14 years 9 months ago
Typing dynamic typing
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...
Arthur I. Baars, S. Doaitse Swierstra
TACS
1994
Springer
14 years 1 months ago
ML Typing, Explicit Polymorphism and Qualified Types
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
Mark P. Jones
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
14 years 3 months ago
A Tutorial on Parallel and Concurrent Programming in Haskell
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...
Simon L. Peyton Jones, Satnam Singh
JFP
2007
104views more  JFP 2007»
13 years 9 months ago
Understanding functional dependencies via constraint handling rules
Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules ...
Martin Sulzmann, Gregory J. Duck, Simon L. Peyton ...
HASKELL
2006
ACM
14 years 3 months ago
User-level transactional programming in Haskell
Correct handling of concurrently accessed external resources is a demanding problem in programming. The standard approaches rely on database transactions or concurrency mechanisms...
Peter Thiemann