swMATH9765MaRDI QIDQ21744FDOQ21744
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007%2F978-3-642-22944-2_29
Cited In (35)
- The seventeen provers of the world. Foreword by Dana S. Scott..
- Higman's lemma and its computational content
- 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
- Proofs, programs, processes
- Minlog -- a tool for program extraction supporting algebras and coalgebras
- Extracting imperative programs from proofs: In-place Quicksort
- On the constructive and computational content of abstract mathematics
- An algorithmic version of Zariski's lemma
- Program extraction in exact real arithmetic
- Types for Proofs and Programs
- Extracting verified decision procedures: DPLL and resolution
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
- Extracting a DPLL algorithm
- Program extraction from nested definitions
- A proof-theoretic account of primitive recursion and primitive iteration
- APS-1
- Beluga
- Abella
- Fudgets
- ROSCoq
- Pesca
- Optimized program extraction for induction and coinduction
- KANREN
- CAL
- Teyjus
- AVL trees
- ELPI
- PRIZ
- Limits of real numbers in the binary signed digit representation
- Intuitionistic fixed point logic
- Theorema 2.0: computer-assisted natural-style mathematics
- Functions-as-constructors Higher-order Unification
- Program extraction applied to monadic parsing
This page was built for software: Minlog
