Filters








19 Hits in 3.2 sec

Applications of compactness in the Smyth powerdomain of streams [chapter]

J. -J. Ch. Meyer, E. P. Vink
1987 Lecture Notes in Computer Science  
We show in a uniform setting the crucial role of compactness in the theory of the Smyth powerdomain of streams.  ...  (A recent application of the Smyth powerdomain to the semantics of more refined concurrency languages can be found in [Ma].)  ...  Section 2 The Smyth Powerdomain of Streams In this section we shall establish some useful properties of the Smyth powerdomain in the special case of streams.  ... 
doi:10.1007/3-540-17660-8_59 fatcat:ir4f556pvvddpbchro7vhffjtq

Page 2638 of Mathematical Reviews Vol. , Issue 88e [page]

1988 Mathematical Reviews  
Talamo, Efficient representation of taxonomies (pp. 232-240); J.-J. Ch. Meyer and E. P. de Vink, Applications of compactness in the Smyth powerdomain of streams (extended abstract) (pp. 241-255); M.  ...  J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra (extended abstract) (pp. 336-347); Dirk Taubner and Walter Vogler, The step failure semantics (pp. 348  ... 

Domain Theory and the Logic of Observable Properties [article]

Samson Abramsky
2011 arXiv   pre-print
Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications.  ...  The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: - Domain Theory, the mathematical theory of computation introduced  ...  Note that the Plotkin powerdomain is built from the combination of the must modality ✷ of the Smyth powerdomain and the may modality ✸ of the Hoare powerdomain (cf. [Abr83a, Win83] ).  ... 
arXiv:1112.0347v1 fatcat:dtnbwwmcrret5lgh2yusnmtq4m

Semantic Domains and Denotational Semantics

Carl A. Gunter, Peter D. Mosses, Dana S. Scott
1989 DAIMI Report Series  
</p><p>Both chapters are to appear in the forthcoming Handbook of Theoretical Computer Science (North-Holland).</p>  ...  It explains the formal notation used in denotational descriptions, and illustrates the major standard technigues for finding denotations of programming constructs.  ...  The upper powerdomain Da was introduced by Mike Smyth [Smy78] and is sometimes called the Smyth powerdomain.  ... 
doi:10.7146/dpb.v18i276.7630 fatcat:i27j4middfapxjlvuuiyjwf4ma

A Domain Theory for Statistical Probabilistic Programming [article]

Matthijs Vákár, Ohad Kammar, Sam Staton
2021 arXiv   pre-print
These are expressive languages for building Bayesian models of the kinds used in computational statistics and machine learning.  ...  Probability is traditionally treated in cpo models using probabilistic powerdomains, but these are not known to be commutative on any class of cpos with higher order functions.  ...  We are grateful to the reviewers for their suggestions.  ... 
arXiv:1811.04196v2 fatcat:45t52scam5hnbi2pglyrxqbfga

Contrasting themes in the semantics of imperative concurrency [chapter]

J. W. de Bakker, J. N. Kok, J. -J. Ch. Meyer, E.-R. Olderog, J. I. Zucker
1986 Lecture Notes in Computer Science  
We are grateful to Jan Rutten, who has been of great help in preparing the text of this paper.  ...  We expect that our Smyth order based cpo is isomorphic to the general Smyth powerdomain over Ast, assuming the (usual) finiteness of A. Oosed sets are then compact and the elements of'?  ...  Pnq(.A 81 ) are candidates for a set of representatives of the elements in the general Smyth powerdomain.  ... 
doi:10.1007/bfb0027040 fatcat:uvgapn2pmzbqviuilrnu7wirl4

A domain theory for statistical probabilistic programming

Matthijs Vákár, Ohad Kammar, Sam Staton
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
These are expressive languages for building Bayesian models of the kinds used in computational statistics and machine learning.  ...  Probability is traditionally treated in cpo models using probabilistic powerdomains, but these are not known to be commutative on any class of cpos with higher order functions.  ...  We are grateful to the reviewers for their suggestions.  ... 
doi:10.1145/3290349 fatcat:qvrwc47q3fcnxdxriv5m4ueume

First-Order Universality for Real Programs [chapter]

Thomas Anberrée
2009 Lecture Notes in Computer Science  
To be precise, we show that each computable function f : R → R we consider is the extension of the denotation M f of some program M f : real → real, in a model based on powerdomains, described in previous  ...  We briefly indicate how our proof extends to show that functions taken from a large class of computable, first-order partial functions in several arguments are definable.  ...  This work was originally part of the my PhD dissertation written at the University of Birmingham, under the supervision of Martín Escardó, whom I very cheerfully thank [2] .  ... 
doi:10.1007/978-3-642-03073-4_1 fatcat:54awoahd5batdj5q63dd56jkle

Domain Theory and its Applications

Stephen Brookes, Manfred Droste, Michael Mislove
unpublished
the work of Achim Jung (Birmingham) in which the approach of abstract bases, originally proposed by M.  ...  The seminar focused on this diverse range of applications, as well as on the role of domain theory in its more established areas of application.  ...  stream functions, avoiding the anomalies and building in fairness.  ... 
fatcat:uq7x263dg5akzk2syfbubbdghq

Induction and recursion on datatypes [chapter]

Henk Doornbos, Roland Backhouse
1995 Lecture Notes in Computer Science  
We conclude that the very compact notation of relation algebra and the concise reasoning it supports can be put to great use in applications -in our case, the more complicated proofs for combinatory term  ...  In the talk a review was given of the highly compact formulations of "is wellfounded" and "admits induction" in relation algebra.  ...  The use of this algebra is illustrated by derivations of a shortest path, a hamiltonian circuits, and a sorting algorithm. All derivations are formal, understandable and concise.  ... 
doi:10.1007/3-540-60117-1_14 fatcat:namzjvik6vapne363qzzvaqdlu

Computable concurrent processes

Yiannis N. Moschovakis
1995 Theoretical Computer Science  
implementable" in the sense of Park (1980).  ...  ~A preliminary version of these results was announced in the 1990 POPL meeting [12] .  ...  Whitney has obtained similar "embedding" results for the Hoare and Smyth powerdomains [22] .  ... 
doi:10.1016/0304-3975(94)00117-2 fatcat:id6dinjhlrcb3l6fksls272jna

Reference list of indexed articles

1999 Theoretical Computer Science  
De Vink, Applications of compactness in the Smyth powerdomain of streams 57 (2-3) ( 1988) 25 l-282 M.P. Bcal. Codes circulaires, automates locaux et entropie 57 (2-3) (1988) 283-302 K.  ...  Olderog, Infinite streams and finite observations in the semantics of uniform concurrency 49 (2-3) (1987) 87-l 12 962. M.G. Main, W. Bucher and D.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m

Page 1075 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
Applications of compactness in the Smyth powerdomain of streams (extended abstract). (See 88e:68010) See also de Bakker, J. W.; et al., 88a:68071 and (88f:68003) Mints, G. (with Tyugu, E.)  ...  On the description of data structures of programming languages. (Russian) (Not in MR) Mulmuley, Ketan Fully abstract submodels of typed lambda calculi. 88f:68098 Naudin, P.  ... 

Merging regular processes by means of fixed-point theory

J.-J.Ch. Meyer
1986 Theoretical Computer Science  
This kind of recursion when applied in a regular form is the equivalent of the Kleene-star iteration known from formal language theory.  ...  Finally, we use this to prove the correctness of a formalism similar to the one for arbitrary merge in order to calculate the fair merge of two regular sequential (nondeterrainistic) processes with g-recursion  ...  ) restrictions of closedness and compactness of the trace sets in the domain.  ... 
doi:10.1016/0304-3975(86)90045-9 fatcat:d2as4lexwvg4rfxogltphthc7i

Page 1182 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
Applications of compactness in the Smyth powerdomain of streams (extended abstract). TAPSOFT °87, Vol. 1 (Pisa, 1987), 241-255, Lecture Notes in Comput. Sci., 249, Springer, Berlin-New York, 1987.  ...  (Summary) 88b:65029 65D20 (65D32) Vincenzi, Antonio On the abstract model-theoretic neighbourhood of the logics of computer languages. I. Compactness.  ... 
« Previous Showing results 1 — 15 out of 19 results