2529 search results - page 271 / 506 » The Logical Structure of Binding |
140
Voted
APAL
2007
15 years 6 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
189
click to vote
ENTCS
2006
15 years 6 months ago
2006
Formal notations for system performance modeling need to be equipped with suitable notations for specifying performance measures. These companion notations have been traditionally...
173
click to vote
LOGCOM
1998
15 years 6 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
192
click to vote
SCAM
2008
IEEE
16 years 1 months ago
2008
IEEE
—More and more current software systems rely on non trivial coordination logic for combining autonomous services typically running on different platforms and often owned by diffe...
196
click to vote
MIDDLEWARE
2007
Springer
16 years 24 days ago
2007
Springer
Recent research advances in Peer-to-Peer (P2P) computing have enabled the P2P paradigm to be used for developing complex applications beyond file sharing and data storage. These ...