Minlog

swMATH9765MaRDI QIDQ21744FDOQ21744

Author name not available (Why is that?)

Cited In (23)

• The seventeen provers of the world. Foreword by Dana S. Scott..
• Extracting verified decision procedures: DPLL and Resolution
• A realizability interpretation of Church's simple theory of types
• \textsc{Prawf}: an interactive proof system for program extraction
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration
• Program Extraction from Nested Definitions
• An algorithmic version of Zariski's lemma
• Program extraction in exact real arithmetic
• Types for Proofs and Programs
• Higman’s Lemma and Its Computational Content
• The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
• Extracting Imperative Programs from Proofs: In-place Quicksort
• Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
• On the Constructive and Computational Content of Abstract Mathematics
• Theorema 2.0: Computer-Assisted Natural-Style Mathematics
• Optimized program extraction for induction and coinduction
• Limits of real numbers in the binary signed digit representation
• Proofs, Programs, Processes
• Extracting a DPLL Algorithm
• Intuitionistic fixed point logic
• Functions-as-constructors Higher-order Unification
• Program extraction applied to monadic parsing

This page was built for software: Minlog