Sciweavers

34 search results - page 4 / 7
» Haskell Is Not Not ML
Sort
View
LPAR
2012
Springer
12 years 3 months ago
Smart Testing of Functional Programs in Isabelle
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Lukas Bulwahn
POPL
1997
ACM
13 years 11 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ICFP
2002
ACM
14 years 7 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
APAL
2008
90views more  APAL 2008»
13 years 7 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
POPL
1993
ACM
13 years 11 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