The Smyth completion: a common foundation for denotational semantics and complexity analysis
@inproceedings{Schellekens1995TheSC,
title={The Smyth completion: a common foundation for denotational semantics and complexity analysis},
author={Michel P. Schellekens},
booktitle={Mathematical Foundations of Programming Semantics},
year={1995}
}159 Citations
On the structure of the dual complexity space: the general case
- Mathematics
- 1998
The purpose of this note is to report the main results obtained by the authors in [8] and [9], respectively. The notion of a Smyth completable quasi-uniform space provides an efficient tool to give a…
New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- Computer Science, MathematicsInt. J. Comput. Math.
- 2012
The original Schellekens method is extended in order to yield asymptotic upper bounds for a certain class of recursive algorithms whose running time of computing cannot be discussed following the techniques given by Cerdà-Uguet et al.
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- Computer ScienceLATA
- 2009
An extension of the generalized complexity spaces of Romaguera and Schellekens is presented and it is shown that the new complexity approach is suitable to provide quantitative computational models in Theoretical Computer Science.
The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- Computer ScienceInt. J. Comput. Math.
- 2011
An extension of the complexity space of partial functions is constructed and it is shown that it is an appropriate mathematical tool for the complexity analysis of algorithms and for the validation of recursive definitions of programs.
An extension of the dual complexity space and an application to Computer Science
- Mathematics, Computer Science
- 2009
Complexity Spaces Revisited
- Mathematics
- 1996
The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this…
Valuations revisited
- MathematicsIWFM
- 1999
The main purpose of this short note is to provide a basic introduction to the notion of a semivaluation independent of the domain theoretic considerations of [Sch98] and to discuss a recently obtained characterization of valuations in terms of semivaluations.
The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances
- Computer Science, MathematicsMFCSIT
- 2002
References
SHOWING 1-4 OF 4 REFERENCES
Weighted Quasi‐Metrics
- Computer Science
- 1994
ABSTRACT: We study the class of topologies which are induced by weighted quasi‐metrics (equivalently, partial metrics). Partial metrics were introduced by S. Matthews in his study of topological…
The Art of Computer Programming
- Engineering, Physics
- 1968
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.