The Expression Lemma

DOI10.1007/978-3-540-70594-9_12MaRDI QIDQ3521989zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ondrej Rypacek, Ralf Lämmel

Publication date 28 August 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70594-9_12

zbMATH Keywords

catamorphismcofree comonaddistributive lawexpression lemmaexpression problemfoldfree monadfunctional objectprogram calculationthe composite design pattern

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)

Recommendations

• Initial Algebra Semantics Is Enough!
• scientific article; zbMATH DE number 3970091
• Paramorphisms
• A principled approach to programming with nested types in Haskell
• Functional programming with apomorphisms (corecursion)

Cites work

• Adding recursive constructs to bialgebraic semantics
• An approach to object semantics based on terminal co-algebras
• Category Theory
• Deriving structural hylomorphisms from recursive definitions
• Distributive laws for the coinductive solution of recursive equations
• Functional programming with apomorphisms (corecursion)
• scientific article; zbMATH DE number 1195981 (Why is no real title available?)
• scientific article; zbMATH DE number 1479621 (Why is no real title available?)
• scientific article; zbMATH DE number 3296291 (Why is no real title available?)
• Paramorphisms
• Recursion Schemes for Dynamic Programming
• Recursion schemes from comonads
• Simple type-theoretic foundations for object-oriented programming
• Tupling calculation eliminates multiple data traversals

Describes a project that uses

Uses Software

• Scala

This page was built for publication: The Expression Lemma

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