Sciweavers

669 search results - page 63 / 134
» Haskell program coverage
Sort
View
FLOPS
2004
Springer
14 years 2 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
GI
2009
Springer
14 years 1 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
POPL
1997
ACM
14 years 1 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
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
FP
1995
110views Formal Methods» more  FP 1995»
14 years 14 days ago
Using Types to Parse Natural Language
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
Mark P. Jones, Paul Hudak, Sebastian Shaumyan