First-order universality for real programs

DOI10.1093/LOGCOM/EXR044MaRDI QIDQ2843994zbMATH OpenOpenAlexFDO

Authors 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

computabilitydenotational semanticsreal number computationsimply typed lambda-calculus

Mathematics Subject Classification ID

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

Recommendations

• First-order universality for real programs
• Machines, Computations, and Universality
• Typed realizability for first-order classical analysis
• scientific article; zbMATH DE number 1984522
• scientific article; zbMATH DE number 3893184
• Loop-separable programs and their first-order definability
• Necessary and sufficient conditions for the universality of programming formalisms
• Universality and semicomputability for nondeterministic programming languages over abstract algebras
• Program synthesis using realizability

Cited in

(4)

• A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
• Sequential real number computation and recursive relations
• First-order universality for real programs
• Sequential real number computation and recursive relations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843994)