TY  - RPRT
A1  - Möller, Bernhard
T1  - Algebraic calculation of graph and sorting algorithms
N2  - We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds to the algebra of (multiary) relations. This algebra is then used in the formal specification and derivation of some graph and sorting algorithms. This study is part of an attempt to single out a framework for program development at a very high level of discourse, close to informal reasoning but still with full formal precision.
T3  - Reports des Instituts für Mathematik der Universität Augsburg - 286 
Y1  - 2022
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/92888
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-928886
PB  - Institut für Mathematik, Universität Augsburg
CY  - Augsburg
ER  -