Sequentially and piecewise-affinity in segments of real-PCF

Research output: Journal PublicationConference articlepeer-review

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)3-43
Number of pages41
JournalElectronic Notes in Theoretical Computer Science
Volume73
DOIs
Publication statusPublished - 25 Oct 2004
Externally publishedYes
EventProceedings of the Workshop on Domains VI - Birmingham, United Kingdom
Duration: 16 Sep 200219 Sep 2002

Keywords

  • Interval domain
  • Logical relations
  • PCF
  • Real-PCF
  • Real-number computation
  • Sequentially

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Sequentially and piecewise-affinity in segments of real-PCF'. Together they form a unique fingerprint.

Cite this