Synthesis of sorting algorithms using multisets in \textit{Theorema}

DOI10.1016/j.jlamp.2020.100635zbMath1455.68245arXiv1909.01747OpenAlexW3108194029MaRDI QIDQ1996870

Tudor Jebelean, Isabela Drămnesc

Publication date: 26 February 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.01747

zbMATH Keywords

synthesisautomated reasoningmultisetssorting algorithmslistsTheorema

Mathematics Subject Classification ID

Searching and sorting (68P10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} ⋮ Experiments with automated reasoning in the class

Uses Software

• Theorema
• ALISA
• KIDS

Cites Work

• Synthesis of list algorithms by mechanical proving
• Multiset theory
• A synthesis of several sorting algorithms
• Remarks on A synthesis of several sorting algorithms
• Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
• Deductive synthesis of sorting programs
• An approach to automatic deductive synthesis of functional 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
• Derivation of Sorting Algorithms from a Specification
• A Deductive Approach to Program Synthesis
• Theorema 2.0: Computer-Assisted Natural-Style Mathematics
• From program verification to program synthesis
• Rippling: Meta-Level Guidance for Mathematical Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesis of sorting algorithms using multisets in \textit{Theorema}