An example of goal-directed, calculational proof

DOI10.1017/S095679682400011XMaRDI QIDQ6976538zbMATH OpenFDO

Authors Roland C. Backhouse, Walter Guttmann, Michael Winter

Publication date 2 June 2025

Published in Journal of Functional Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S095679682400011X

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Relational systems, laws of composition (08A02) Applications of universal algebra in computer science (08A70) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Components and acyclicity of graphs. An exercise in combining precision with concision
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• On the shape of mathematical arguments

This page was built for publication: An example of goal-directed, calculational proof

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