3713 search results - page 446 / 743 » Constructing a Calculus of Programs |
245
click to vote
PEPM
2009
ACM
17 years 4 months ago
2009
ACM
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
132
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
144
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
141
click to vote
ICEIS
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
138
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...