Realisability and adequacy for (co)induction

DOI10.4230/OASICS.CCA.2009.2258zbMath1247.03126OpenAlexW1498421687MaRDI QIDQ2917339

Ulrich Berger

Publication date: 28 September 2012

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2258/pdf/Berger.2258.pdf

zbMATH Keywords

semanticsprogram extractionconstructive analysisrealisability

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Inductive definability (03D70) Computation over the reals, computable analysis (03D78)

Related Items (1)

Nonflatness and totality

Uses Software

• RZ

This page was built for publication: Realisability and adequacy for (co)induction