89 search results - page 5 / 18 » A Program Inverter for a Functional Language with Equality a... |
FPCA
1995
13 years 11 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
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...