Paramorphisms

DOI10.1007/BF01211391zbMath0754.68086OpenAlexW4244792373MaRDI QIDQ1201295

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)

Related Items (15)

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 ⋮ Unifying structured recursion schemes ⋮ The Expression Lemma ⋮ Unnamed Item ⋮ A Duality of Sorts ⋮ When is a function a fold or an unfold? ⋮ Algebraic Specialization of Generic Functions for Recursive Types ⋮ Least and greatest fixed points in intuitionistic natural deduction ⋮ Scala for generic programmers ⋮ Datatype-generic termination proofs ⋮ Folding left and right over Peano numbers ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

Cites Work

• Data structures and program transformation
• Do-it-yourself type theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Paramorphisms