A principled approach to programming with nested types in Haskell

DOI10.1007/s10990-009-9047-7zbMath1183.68141OpenAlexW2056539427MaRDI QIDQ848745

Neil Ghani, Patricia Johann

Publication date: 5 March 2010

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-009-9047-7

zbMATH Keywords

initial algebrasnested typesshort cut fusionstructured recursion

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (6)

Map fusion for nested datatypes in intensional type theory ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Unnamed Item ⋮ Parametricity for primitive nested types ⋮ Nested session types ⋮ Proof Relevant Corecursive Resolution

Uses Software

• Haskell
• Polyp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functorial polymorphism
• Inductive families
• Iteration and coiteration schemes for higher-order and nested datatypes
• A generalization of short-cut fusion and its correctness proof
• Disciplined, efficient, generalised folds for nested datatypes
• Generalised folds for nested datatypes
• Manufacturing datatypes
• Monadic augment and generalised short cut fusion
• Foundations for structured programming with GADTs
• Initial Algebra Semantics Is Enough!
• The Category-Theoretic Solution of Recursive Domain Equations
• de Bruijn notation as a nested datatype
• Parametric polymorphism and operational equivalence
• Perfect trees and bit-reversal permutations
• Purely Functional Data Structures
• The view from the left
• A new approach to generic functional programming
• Polish parsers, step by step
• Programming Languages and Systems

This page was built for publication: A principled approach to programming with nested types in Haskell