Exact real number computations relative to hereditarily total functionals.

DOI10.1016/S0304-3975(01)00100-1MaRDI QIDQ1607298zbMATH OpenOpenAlexFDO

Authors Dag Normann

Publication date 31 July 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00100-1

zbMATH Keywords

TotalReal-PCFRelative definabilityUniformly definable

Mathematics Subject Classification ID

Recommendations

• Computability over the partial continuous functionals
• scientific article; zbMATH DE number 1531376
• scientific article; zbMATH DE number 2086646
• Hierarchies of total functionals over the reals
• scientific article; zbMATH DE number 1222580

Cites work

• scientific article; zbMATH DE number 4212032 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 1531372 (Why is no real title available?)
• scientific article; zbMATH DE number 1390018 (Why is no real title available?)
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Computability over the partial continuous functionals
• Full abstraction, totality and PCF
• LCF considered as a programming language
• PCF extended with real numbers
• The hereditary partial effective functionals and recursion theory in higher types

Cited in

(3)

• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• Computability over the partial continuous functionals
• Semantics of a sequential language for exact real-number computation

This page was built for publication: Exact real number computations relative to hereditarily total functionals.

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