Searching for "Type-Indexed Data Types." – sorted by Relevance.
-
Type-Indexed Data Types
- Abstract Type-indexed data types Ralf Hinze a Johan Jeuring b,c Andres Löh b a Institut für
- Cited by 43 (16 self) – Add To MetaCart
-
Generic Haskell: applications
- will encounter several new generic programming concepts: – Type-indexed data types. A type-indexed data type
- Cited by 22 (13 self) – Add To MetaCart
-
Phantom Types
- rise to a dierent trie structure. In fact, tries serve as a nice example of so-called type-indexed data
- Cited by 71 (0 self) – Add To MetaCart
-
The Generic HASKELL User's Guide - Version 0.99 - Amber release
- ); better support for fixpoints • improved support for type-indexed data types • XML, generic traversals
- Add To MetaCart
-
Partial Vectorisation of Haskell Programs
- ]. Concretely, PA is a type-indexed data type family representing vectorised arrays. In GHC’s type
- Cited by 2 (2 self) – Add To MetaCart
-
Managing data-types : the CORBA Approach and AutoMap/AutoLink, an MPI Solution
- through every possible element 7 data-types, the second for indexing the data-type elements for such node
- Add To MetaCart
-
Generic views on data types
- to define. Furthermore, the approach does not naturally generalize to type-indexed data types [11, 22]. We
- Cited by 13 (4 self) – Add To MetaCart
-
Type inference for generic Haskell
- with amongst others type-indexed functions which have kind-indexed types, and type-indexed data types which
- Cited by 1 (0 self) – Add To MetaCart
-
A Lightweight Approach to Datatype-Generic Rewriting
- be translated to plain Haskell as well. Second, we use a type-indexed data type for specifying rules. This is a
- Cited by 3 (3 self) – Add To MetaCart
-
A Lightweight Approach to Datatype-Generic Rewriting
- easily be translated to plain Haskell as well. Second, we use a type-indexed data type for specifying
- Add To MetaCart

