Exact real number computations relative to hereditarily total functionals

Theoretical Computer Science

Volumn 284, Issue 2, 2002, Pages 437-453

  Normann, Dag ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

Real PCF; Relative definability; Total; Uniformly definable

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; NUMBER THEORY; SEMANTICS; THEOREM PROVING;

REAL NUMBER COMPUTATIONS;

COMPUTATIONAL METHODS;

EID: 0037189799     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00100-1     Document Type: Article

References (13)

1. PCF extended with real numbers
2. The hereditarily partial effective functionals and recursion theory in higher types
3. The continuous functionals
4. Computability over the partial continuous functionals
5. The continuous functionals of finite types over the reals
6. LCF considered as a programming language
7. Full abstraction, totality and PCF
8. Models of polymorphism with totality
9. A type-theoretical alternative to ISWIM, CUCH, OWHY