Synthesis of list algorithms by mechanical proving
From MaRDI portal
Recommendations
- Proof-based synthesis of sorting algorithms for trees
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Deductive synthesis of sorting programs
- scientific article; zbMATH DE number 108494
Cites work
- scientific article; zbMATH DE number 3469999 (Why is no real title available?)
- scientific article; zbMATH DE number 1254011 (Why is no real title available?)
- scientific article; zbMATH DE number 1926611 (Why is no real title available?)
- scientific article; zbMATH DE number 2217734 (Why is no real title available?)
- A Deductive Approach to Program Synthesis
- A note on synthesis and classification of sorting algorithms
- A synthesis of several sorting algorithms
- Algorithm classification through synthesis
- Algorithm synthesis by lazy thinking: examples and implementation in Theorema
- Algorithm synthesis by lazy thinking: using problem schemes
- Linear resolution with selection function
- Logic program synthesis
- Mathematical Knowledge Management
- Middle-out reasoning for synthesis and induction
- Program Development in Computational Logic
- Programs as proofs: A synopsis
- Proofs as programs
- Proving Properties of Programs by Structural Induction
- Remarks on A synthesis of several sorting algorithms
- Rippling: Meta-Level Guidance for Mathematical Reasoning
- Synthesis: Dreams → Programs
- The TH\(\exists\)OREM\(\forall\) project: A progress report
- The design of divide and conquer algorithms
- \textit{Theorema}: Towards computer-aided mathematical theory exploration
Cited in
(11)- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}
- Algorithm synthesis by lazy thinking: examples and implementation in Theorema
- Proof pearl: A mechanized proof of GHC's mergesort
- Deductive synthesis of sorting programs
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Proof-based synthesis of sorting algorithms for trees
- Proving Properties about Lists Using Containers
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
- scientific article; zbMATH DE number 2217734 (Why is no real title available?)
- Algorithm synthesis by lazy thinking: using problem schemes
This page was built for publication: Synthesis of list algorithms by mechanical proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485837)
