Handbook of logic in computer science (vol. 3)
A computational model for metric spaces
Theoretical Computer Science
A foundation for computation
A Renee Equation for Algorithmic Complexity
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Measuring the Probabilistic Powerdomain
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Informatic Derivative at a Compact Element
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Domain Theory and the Causal Structure of Space-Time
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Domain Theoretic Model of Qubit Channels
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Completeness and compactness of quantitative domains
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We introduce the measurement idea in domain theory and then apply it to establish two fixed point theorems. The first is an extension of the Scott fixed point theorem which applies to nonmonotonic mappings. The second is a contraction principle for monotone maps that guarantees the existence of unique fixed points.