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 language | English |
---|---|
Pages (from-to) | 248-257 |
Number of pages | 10 |
Journal | Proceedings - Symposium on Logic in Computer Science |
Publication status | Published - 1997 |
Event | Proceedings of the 1997 12th Annual IEEE Symposium on Logic in Computer Science, LICS - Warsaw, Pol Duration: 29 Jun 1997 → 2 Jul 1997 |
ASJC Scopus subject areas
- Software
- General Mathematics