Program morphisms
From MaRDI portal
Publication:1203125
DOI10.1007/BF03180569zbMath0760.68050OpenAlexW2911557865MaRDI QIDQ1203125
Publication date: 4 February 1993
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03180569
arrowsimulationcategoryfunctorprogram transformationspecificationnatural transformationtheory morphismrecursive definitionderivor
Specification and verification (program logics, model checking, etc.) (68Q60) Theories (e.g., algebraic theories), structure, and semantics (18C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correctness of recursive parallel nondeterministic flow programs
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- Partial parametrization eliminates multiple traversals of data structures
- On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
- Higher-order Transformations and Type Simulations
- Algorithm classification through synthesis
- A Transformation System for Developing Recursive Programs
This page was built for publication: Program morphisms
