Semantics of exact real arithmetic

Peter John Potts*, Abbas Edalat, Martin Hotzel Escardo

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with non-negative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.

Original languageEnglish
Pages (from-to)248-257
Number of pages10
JournalProceedings - Symposium on Logic in Computer Science
Publication statusPublished - 1997
EventProceedings of the 1997 12th Annual IEEE Symposium on Logic in Computer Science, LICS - Warsaw, Pol
Duration: 29 Jun 19972 Jul 1997

ASJC Scopus subject areas

  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Semantics of exact real arithmetic'. Together they form a unique fingerprint.

Cite this