Minlog -- a tool for program extraction supporting algebras and coalgebras
DOI10.1007/978-3-642-22944-2_29zbMATH Open1344.68201OpenAlexW74548528MaRDI QIDQ3090883FDOQ3090883
Authors: Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger
Publication date: 2 September 2011
Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22944-2_29
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cited In (13)
- 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
- Nonflatness and totality
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- On the constructive and computational content of abstract mathematics
- An algorithmic version of Zariski's lemma
- Extracting total Amb programs from proofs
- Extracting a DPLL algorithm
- Program extraction from nested definitions
- Intuitionistic fixed point logic
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Minlog -- a tool for program extraction supporting algebras and coalgebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090883)