Paramorphisms

DOI10.1007/BF01211391MaRDI QIDQ1201295zbMATH OpenOpenAlexFDO

Authors Lambert Meertens

Publication date 17 January 1993

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01211391

zbMATH Keywords

formal program constructioninitial data type

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Functional programming with apomorphisms (corecursion)
• scientific article; zbMATH DE number 1343506
• See more through lenses than bananas
• Parametric (Co)Iteration vs. Primitive Direcursion
• Parametricity as isomorphism

Cites work

• Data structures and program transformation
• Do-it-yourself type theory
• scientific article; zbMATH DE number 3982493 (Why is no real title available?)
• scientific article; zbMATH DE number 3684925 (Why is no real title available?)

Cited in

(30)

• Datatype-generic termination proofs
• See more through lenses than bananas
• Reasoning about algebraic data types with abstractions
• Theory and applications of inverting functions as folds
• Functional programming with apomorphisms (corecursion)
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Scala for generic programmers
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• The Expression Lemma
• scientific article; zbMATH DE number 5711167 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 512948 (Why is no real title available?)
• scientific article; zbMATH DE number 517048 (Why is no real title available?)
• When is a function a fold or an unfold?
• Folding left and right over Peano numbers
• scientific article; zbMATH DE number 7437711 (Why is no real title available?)
• Algebraic specialization of generic functions for recursive types
• Some remarks on type systems for course-of-value recursion
• Metamorphism in jigsaw
• Mathematics of Program Construction
• Unifying structured recursion schemes. An extended study
• A duality of sorts
• Parametric compositional data types
• Least and greatest fixed points in intuitionistic natural deduction
• Constructing language processors with algebra combinators
• Folding left and right matters: Direct style, accumulators, and continuations
• Classical (co)recursion: Mechanics
• Fantastic morphisms and where to find them. A guide to recursion schemes
• Recursion schemes in Coq
• Metamorphisms: streaming representation-changers

This page was built for publication: Paramorphisms

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