scientific article
From MaRDI portal
Publication:3075213
zbMath1219.03074MaRDI QIDQ3075213
Publication date: 10 February 2011
Full work available at URL: http://www.jucs.org/jucs_16_18/realisability_for_induction_and
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
program extractioncomputable analysiscoinductionexact real number computationextensions of first-order theoriesrealisability interpretationuntyped \(\lambda \)-calculus
Constructive and recursive analysis (03F60) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40) Inductive definability (03D70) Computation over the reals, computable analysis (03D78)
Related Items (8)
Typed vs. Untyped Realizability ⋮ A realizability interpretation of Church's simple theory of types ⋮ Type-theoretic approaches to ordinals ⋮ 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 ⋮ \textsc{Prawf}: an interactive proof system for program extraction
Uses Software
This page was built for publication:
