Pages that link to "Item:Q485837"
From MaRDI portal
The following pages link to Synthesis of list algorithms by mechanical proving (Q485837):
Displaying 8 items.
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← 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)
- Proof pearl: A mechanized proof of GHC's mergesort (Q2351394) (← links)
- Algorithm synthesis by lazy thinking: examples and implementation in Theorema (Q2847391) (← links)
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema (Q5014671) (← links)
- Proving Properties about Lists Using Containers (Q5458431) (← links)