The Smyth completion: a common foundation for denotational semantics and complexity analysis

  title={The Smyth completion: a common foundation for denotational semantics and complexity analysis},
  author={Michel P. Schellekens},
  booktitle={Mathematical Foundations of Programming Semantics},
  • M. Schellekens
  • Published in
    Mathematical Foundations of…
  • Computer Science

On the structure of the dual complexity space: the general case

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

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

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

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.

Complexity Spaces Revisited

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

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.

Quasi-metric properties of complexity spaces




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

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.