Proofs, Programs, Processes

DOI10.1007/978-3-642-13962-8_5zbMath1280.68077OpenAlexW2164827410MaRDI QIDQ3576189

Monika Seisenberger, Ulrich Berger

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

zbMATH Keywords

program extractioncoinductionrealisabilityexact real number computation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Relative consistency and interpretations (03F25)

Related Items

Typed vs. Untyped Realizability, A realizability interpretation of Church's simple theory of types, Computing with continuous objects: a uniform co-inductive approach, Program extraction in exact real arithmetic, THE THEORY OF SPECTRUM EXCHANGEABILITY

Uses Software

• Haskell
• Minlog