Abstract
Real PCF(RPCF) was proposed by Martín Escardó [8] as a language for Real number computation. One of the key - and most controversial - constants is parallel-if (pifI), the existence of which causes a serious inefficiency in the language leading to RPCF being impractical. While search is being undertaken to replace pifI with a more efficient operator, one needs to be assured of the segment of RPCF without pifI being sequential. A positive answer to this question is the main result of this paper. On the other hand, we show that non-affine functions - such as f(x) := x2 - are not definable in RPCF without pifI.
Original language | English |
---|---|
Pages (from-to) | 3-43 |
Number of pages | 41 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 73 |
DOIs | |
Publication status | Published - 25 Oct 2004 |
Event | Proceedings of the Workshop on Domains VI - Birmingham, United Kingdom Duration: 16 Sept 2002 → 19 Sept 2002 |
Keywords
- Interval domain
- Logical relations
- PCF
- Real-number computation
- Real-PCF
- Sequentially
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science