A synthesis of several sorting algorithms
From MaRDI portal
Publication:1251072
DOI10.1007/BF00264597zbMath0389.68037OpenAlexW2013373314MaRDI QIDQ1251072
Publication date: 1978
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264597
Related Items (20)
\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} ⋮ Corrections to ``A synthesis of several sorting algorithms by J. Darlington ⋮ Programming from metaphorisms ⋮ A strange sorting method inspired by formal differentiation ⋮ Experiments in program verification using Event-B ⋮ Unnamed Item ⋮ Mixed computation: potential applications and problems for study ⋮ Synthesis of list algorithms by mechanical proving ⋮ Program development in constructive type theory ⋮ Synthesis of sorting algorithms using multisets in \textit{Theorema} ⋮ Efficient memo-table management strategies ⋮ Towards a Taxonomy for ECFG and RRPG Parsing ⋮ Provably correct derivation of algorithms using FermaT ⋮ Remarks on A synthesis of several sorting algorithms ⋮ Deductive synthesis of sorting programs ⋮ New dimensions in heap profiling ⋮ Some equivalent transformations of recursive programs based on their schematic properties ⋮ On synthesis of scheduling algorithms ⋮ Top-down synthesis of divide-and-conquer algorithms ⋮ How powerful are folding/unfolding transformations?
This page was built for publication: A synthesis of several sorting algorithms
