Lazy computation with exact real numbers
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
ACM Transactions on Computational Logic (TOCL)
Contractivity of linear fractional transformations
Theoretical Computer Science
Equality in computer algebra and beyond
Journal of Symbolic Computation - Integrated reasoning and algebra systems
A Co-inductive Approach to Real Numbers
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
A Tour with Constructive Real Numbers
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Static Analyses of the Precision of Floating-Point Operations
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
On Termination of Logic Programs with Floating Point Computations
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A characterization of partial metrizability: domains are quantifiable
Theoretical Computer Science - Topology in computer science
Real functions incrementally computable by finite automata
Theoretical Computer Science - Mathematical foundations of programming semantics
The correspondence between partial metrics and semivaluations
Theoretical Computer Science - Mathematical foundations of programming semantics
Termination of Floating-Point Computations
Journal of Automated Reasoning
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
Sequential Real Number Computation and Recursive Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy Algorithms for Exact Real Arithmetic
Electronic Notes in Theoretical Computer Science (ENTCS)
Automating mathematical program transformations
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
An overview of semantics for the validation of numerical programs
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A language for differentiable functions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
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.