\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}
From MaRDI portal
Publication:2119984
Cites work
- A Deductive Approach to Program Synthesis
- A general framework to build contextual cover set induction provers
- A synthesis of several sorting algorithms
- Algorithm synthesis by lazy thinking: using problem schemes
- An approach to automatic deductive synthesis of functional programs
- Automated synthesis of functional programs with auxiliary functions
- Automatic Deductive Synthesis of Lisp Programs in the System ALISA
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
- Deductive synthesis of sorting programs
- Derivation of Sorting Algorithms from a Specification
- From program verification to program synthesis
- scientific article; zbMATH DE number 3913652 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1822263 (Why is no real title available?)
- scientific article; zbMATH DE number 2217734 (Why is no real title available?)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Multiset theory
- Remarks on A synthesis of several sorting algorithms
- Rippling: Meta-Level Guidance for Mathematical Reasoning
- Synthesis of list algorithms by mechanical proving
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- Theorema 2.0: A System for Mathematical Theory Exploration
- Theorema 2.0: computer-assisted natural-style mathematics
This page was built for publication: \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119984)
