291 search results - page 36 / 59 » CPP Denotational Semantics |
109
Voted
IFM
2007
Springer
15 years 6 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
113
Voted
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
112
Voted
ILP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
114
Voted
ENTCS
2006
15 years 14 days ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...