TACS
2001
Springer
13 years 9 months ago
2001
Springer
Parigot suggested symmetric structural reduction rules for ion to µ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order ...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
TACS
2001
Springer
13 years 9 months ago
2001
Springer
TACS
2001
Springer
13 years 9 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 9 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...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
TACS
2001
Springer
13 years 9 months ago
2001
Springer
We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our lo...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
Boxed Ambients are a variant of Mobile Ambients that result from (i) dropping the open capability and (ii) providing new primitives for ambient communication while retaining the co...