Pages that link to "Item:Q1251072"
From MaRDI portal
The following pages link to A synthesis of several sorting algorithms (Q1251072):
Displaying 20 items.
- Experiments in program verification using Event-B (Q432154) (← links)
- Synthesis of list algorithms by mechanical proving (Q485837) (← links)
- Efficient memo-table management strategies (Q582879) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
- On synthesis of scheduling algorithms (Q799101) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- Corrections to ``A synthesis of several sorting algorithms'' by J. Darlington (Q1106020) (← links)
- A strange sorting method inspired by formal differentiation (Q1151046) (← links)
- Mixed computation: potential applications and problems for study (Q1169808) (← links)
- Program development in constructive type theory (Q1190474) (← links)
- Remarks on ''A synthesis of several sorting algorithms'' (Q1259168) (← links)
- Programming from metaphorisms (Q1683699) (← links)
- Deductive synthesis of sorting programs (Q1822927) (← links)
- Synthesis of sorting algorithms using multisets in \textit{Theorema} (Q1996870) (← links)
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} (Q2119984) (← links)
- New dimensions in heap profiling (Q3125160) (← links)
- Towards a Taxonomy for ECFG and RRPG Parsing (Q3618599) (← links)
- How powerful are folding/unfolding transformations? (Q4764267) (← links)
- (Q5020646) (← links)
