Sciweavers

1729 search results - page 85 / 346
» Generic Haskell: Applications
Sort
View
ICFP
2003
ACM
16 years 6 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
ICFP
2002
ACM
16 years 6 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
ICFP
2001
ACM
16 years 6 months ago
A New Notation for Arrows
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
Ross Paterson
TOOLS
2009
IEEE
16 years 1 months ago
Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
Christian Kästner, Sven Apel, Salvador Trujil...
PACT
2009
Springer
16 years 1 months ago
Parallel FFT with Eden Skeletons
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...