Reductivity

DOI10.1016/0167-6423(95)00027-5zbMath0848.68054DBLPjournals/scp/DoornbosB96OpenAlexW4212784955WikidataQ56874030 ScholiaQ56874030MaRDI QIDQ1916366

Henk Doornbos, Roland C. Backhouse

Publication date: 11 September 1996

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(95)00027-5

zbMATH Keywords

initialityinductivityreductivity of a relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Formal derivation of greedy algorithms from relational specifications: a tutorial ⋮ A calculational approach to mathematical induction ⋮ Assertions and recursions ⋮ Datatype-generic termination proofs ⋮ Algebra of programming in Agda: Dependent types for relational program derivation ⋮ Nondeterministic semantics of compound diagrams

This page was built for publication: Reductivity