Pages that link to "Item:Q1822927"
From MaRDI portal
The following pages link to Deductive synthesis of sorting programs (Q1822927):
Displaying 14 items.
- Synthesis of list algorithms by mechanical proving (Q485837) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- The origin of a binary-search paradigm (Q1098328) (← links)
- A note on synthesis and classification of sorting algorithms (Q1118415) (← links)
- Program construction by verifying specification (Q1273080) (← links)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- A theory for deductive synthesis of algorithms in the computing milieu (Q1900220) (← links)
- Synthesis of sorting algorithms using multisets in \textit{Theorema} (Q1996870) (← links)
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} (Q2119984) (← links)
- An approach to automatic deductive synthesis of functional programs (Q2457802) (← links)
- (Q4281360) (← links)
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema (Q5014671) (← links)
- (Q5016384) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)