First-order universality for real programs

DOI10.1093/LOGCOM/EXR044zbMath1270.03049OpenAlexW1980902983MaRDI QIDQ2843994

Thomas Anberrée

Publication date: 27 August 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exr044

zbMATH Keywords

denotational semanticscomputabilityreal number computationsimply typed lambda-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computation over the reals, computable analysis (03D78)

This page was built for publication: First-order universality for real programs