Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema

DOI10.1007/978-3-030-43120-4_13OpenAlexW3011039584MaRDI QIDQ5014671

Tudor Jebelean, Isabela Drămnesc

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43120-4_13

zbMATH Keywords

binary treesmultisetstheoremaalgorithm synthesis

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items (3)

\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} ⋮ Experiments with automated reasoning in the class ⋮ Generalized mapping for multiset rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of list algorithms by mechanical proving
• Multiset theory
• Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
• Deductive synthesis of sorting programs
• Proof–Based Synthesis of Sorting Algorithms for Trees
• Theorema 2.0: A System for Mathematical Theory Exploration
• Automatic Deductive Synthesis of Lisp Programs in the System ALISA
• A Deductive Approach to Program Synthesis
• Theorema 2.0: Computer-Assisted Natural-Style Mathematics

This page was built for publication: Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema