First-Order Universality for Real Programs

DOI10.1007/978-3-642-03073-4_1zbMath1268.03033OpenAlexW1562872676MaRDI QIDQ3576032

Thomas Anberrée

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_1

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)

Cites Work

• LCF considered as a programming language
• Feasible real random access machines
• Recursive characterization of computable real-valued functions and relations
• Semantics of a sequential language for exact real-number computation
• On the definitions of computable real continuous functions
• A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: First-Order Universality for Real Programs