Proofs, programs, processes
DOI10.1007/978-3-642-13962-8_5zbMATH Open1280.68077OpenAlexW2164827410MaRDI QIDQ3576189FDOQ3576189
Authors: Ulrich Berger, Monika Seisenberger 
Publication date: 29 July 2010
Published in: Programs, Proofs, Processes (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2805
Recommendations
- Proofs, programs, processes
- Program extraction via typed realisability for induction and coinduction
- From coinductive proofs to exact real arithmetic: theory and applications
- Realisability and adequacy for (co)induction
- Realisability for induction and coinduction with applications to constructive analysis
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Relative consistency and interpretations (03F25)
Cited In (15)
- A realizability interpretation of Church's simple theory of types
- Proofs, programs, processes
- Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30--July 4, 2010. Proceedings
- Program extraction in exact real arithmetic
- Realisability for induction and coinduction with applications to constructive analysis
- Proofs and programs
- Typed vs. untyped realizability
- The theory of spectrum exchangeability
- Proofs as processes
- Computing with continuous objects: a uniform co-inductive approach
- Optimized program extraction for induction and coinduction
- From coinductive proofs to exact real arithmetic: theory and applications
- Program extraction via typed realisability for induction and coinduction
- Intuitionistic fixed point logic
- Title not available (Why is that?)
Uses Software
This page was built for publication: Proofs, programs, processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576189)
