From coinductive proofs to exact real arithmetic: theory and applications
From MaRDI portal
Publication:3003309
DOI10.2168/LMCS-7(1:8)2011zbMath1218.03036MaRDI QIDQ3003309
Publication date: 26 May 2011
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Constructive and recursive analysis (03F60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computation over the reals, computable analysis (03D78)
Related Items (13)
Limits of real numbers in the binary signed digit representation ⋮ Typed vs. Untyped Realizability ⋮ Unnamed Item ⋮ A realizability interpretation of Church's simple theory of types ⋮ Lookahead analysis in exact real arithmetic with logical methods ⋮ Extracting total Amb programs from proofs ⋮ Nonflatness and totality ⋮ Unnamed Item ⋮ Intuitionistic fixed point logic ⋮ On the Constructive and Computational Content of Abstract Mathematics ⋮ Computing with continuous objects: a uniform co-inductive approach ⋮ Proofs, programs, processes ⋮ Polynomial time over the reals with parsimony
Uses Software
This page was built for publication: From coinductive proofs to exact real arithmetic: theory and applications
