A synthesis of several sorting algorithms
From MaRDI portal
Publication:1251072
Cited in
(21)- Top-down synthesis of divide-and-conquer algorithms
- Corrections to ``A synthesis of several sorting algorithms by J. Darlington
- A strange sorting method inspired by formal differentiation
- Mixed computation: potential applications and problems for study
- Program development in constructive type theory
- Remarks on A synthesis of several sorting algorithms
- Programming from metaphorisms
- Deductive synthesis of sorting programs
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}
- New dimensions in heap profiling
- Towards a Taxonomy for ECFG and RRPG Parsing
- Experiments in program verification using Event-B
- How powerful are folding/unfolding transformations?
- Synthesis of list algorithms by mechanical proving
- scientific article; zbMATH DE number 7453187 (Why is no real title available?)
- Efficient memo-table management strategies
- A multi-time stepping algorithm for the modelling of heterogeneous structures with explicit time integration
- Provably correct derivation of algorithms using FermaT
- Some equivalent transformations of recursive programs based on their schematic properties
- On synthesis of scheduling algorithms
This page was built for publication: A synthesis of several sorting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251072)
