Sciweavers

283 search results - page 24 / 57
» Functional Pearls: Probabilistic functional programming in H...
Sort
View
ICFP
2002
ACM
16 years 1 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
ICFP
2008
ACM
16 years 1 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons
PEPM
1994
ACM
15 years 5 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
JFP
2010
82views more  JFP 2010»
14 years 12 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
DAC
2004
ACM
15 years 5 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv