Sciweavers

439 search results - page 4 / 88
» Type invariants for Haskell
Sort
View
ENTCS
2000
83views more  ENTCS 2000»
13 years 8 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
HASKELL
2006
ACM
14 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
HASKELL
2006
ACM
14 years 3 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
ICFP
2008
ACM
14 years 9 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...
JFP
2002
100views more  JFP 2002»
13 years 8 months ago
A typed representation for HTML and XML documents in Haskell
We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML...
Peter Thiemann