16 search results - page 3 / 4 » tacs 2001 |
TACS
2001
Springer
13 years 12 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
AGENTS
2001
Springer
13 years 12 months ago
2001
Springer
The First Trading Agent Competition TAC was held from June 22nd to July 8th, 2000. TAC was designed to create a benchmark problem in the complex domain of emarketplaces and to m...
TACS
2001
Springer
13 years 12 months ago
2001
Springer
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
TACS
2001
Springer
13 years 12 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
TACS
2001
Springer
13 years 12 months ago
2001
Springer
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...