Polytypic programming in Haskell
From MaRDI portal
Recommendations
Cited in
(27)- Iteration and coiteration schemes for higher-order and nested datatypes
- Type-indexed data types
- On building cyclic and shared structures in Haskell
- Polytypic programming in Maude
- Polytypic programming with ease
- Polytypic programming with ease (Extended abstract)
- Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell
- Formal polytypic programs and proofs
- Type-safe run-time polytypic programming
- Polytypic Syntax Tree Operations
- Parametricity for Haskell with Imprecise Error Semantics
- Libraries for generic programming in Haskell
- scientific article; zbMATH DE number 1375587 (Why is no real title available?)
- When do datatypes commute?
- scientific article; zbMATH DE number 2100543 (Why is no real title available?)
- Polytypic proof construction
- CoLoSS: the coalgebraic logic satisfiability solver
- Generic programming with multiple parameters
- A new approach to generic functional programming
- Generic Programming
- Prototyping generic programming in Template Haskell
- Dynamic Construction of Generic Functions
- Programming in Haskell
- Improving Haskell
- Polymorphic subtyping in O'Haskell
- Type-based termination of generic programs
- Generic programming in 3D
This page was built for publication: Polytypic programming in Haskell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466584)