A principled approach to programming with nested types in Haskell

DOI10.1007/S10990-009-9047-7zbMATH Open1183.68141OpenAlexW2056539427MaRDI QIDQ848745FDOQ848745

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

Recommendations

• Initial Algebra Semantics Is Enough!
• scientific article
• Foundations for structured programming with GADTs
• Generalised folds for nested datatypes
• Interleaving data and effects

zbMATH Keywords

initial algebrasnested typesshort cut fusionstructured recursion

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

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

Cited In (11)

• Nested session types
• Parametricity for primitive nested types
• Proof Relevant Corecursive Resolution
• On building cyclic and shared structures in Haskell
• Fantastic morphisms and where to find them. A guide to recursion schemes
• The Expression Lemma
• Title not available (Why is that?)
• Map fusion for nested datatypes in intensional type theory
• Programming Languages and Systems
• Disciplined, efficient, generalised folds for nested datatypes
• Generalised folds for nested datatypes

Uses Software

• Haskell
• Polyp

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848745)