A principled approach to programming with nested types in Haskell

DOI10.1007/S10990-009-9047-7MaRDI QIDQ848745zbMATH OpenOpenAlexFDO

Authors Patricia Johann, Neil Ghani

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)

Recommendations

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

Cites work

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

Cited in

(13)

• Proof relevant corecursive resolution
• Nested session types
• Parametricity for primitive nested types
• On building cyclic and shared structures in Haskell
• Fantastic morphisms and where to find them. A guide to recursion schemes
• The Expression Lemma
• scientific article; zbMATH DE number 7471683 (Why is no real title available?)
• Map fusion for nested datatypes in intensional type theory
• Programming Languages and Systems
• Foundations for structured programming with GADTs
• Disciplined, efficient, generalised folds for nested datatypes
• Generalised folds for nested datatypes
• Deep induction: induction rules for (truly) nested types

Describes a project that uses

Uses Software

• Polyp
• Haskell

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)