Results 1 
4 of
4
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 461 (20 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
 In Proceedings of the First International Conference on Principles and Practice of Constraint Programming
"... When combining languages for symbolic constraints, one is typically faced with the problem of how to treat "mixed" constraints. The two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving metho ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
When combining languages for symbolic constraints, one is typically faced with the problem of how to treat "mixed" constraints. The two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving methods for pure constraints into one for mixed constraints. The paper introduces the notion of a "free amalgamated product" as a possible solution to the first problem. Subsequently, we define socalled simplycombinable structures (SCstructures). For SCstructures over disjoint signatures, a canonical amalgamation construction exists, which for the subclass of strong SCstructures yields the free amalgamated product. The combination technique of [BS92, BaS94a] can be used to combine constraint solvers for (strong) SCstructures over disjoint signatures into a solver for their (free) amalgamated product. In addition to term algebras modulo equational theories, the class of SCstru...
Universal homogeneous causal sets
 Computational Structures for Modelling Space, Time and Causality, Dagstuhl Seminar Proceedings, Internationales Begegnungs und Forschungszentrum (IBFI), Schloss Dagstuhl
, 2006
"... Causal sets are particular partially ordered sets which have been proposed as a basic model for discrete spacetime in quantum gravity. We show that the class C of all countable pastfinite causal sets contains a unique causal set (U, ≤) which is universal (i.e., any member of C can be embedded into ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Causal sets are particular partially ordered sets which have been proposed as a basic model for discrete spacetime in quantum gravity. We show that the class C of all countable pastfinite causal sets contains a unique causal set (U, ≤) which is universal (i.e., any member of C can be embedded into (U, ≤)) and homogeneous (i.e., (U, ≤) has maximal degree of symmetry). Moreover, (U, ≤) can be constructed both probabilistically and explicitly. 1
The study of random structures began wi...
"... Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as causal ..."
Abstract
 Add to MetaCart
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as causal