468 search results - page 4 / 94 » A New Type System for Deadlock-Free Processes |
ESOP
2012
Springer
12 years 1 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
ENTCS
1998
13 years 5 months ago
1998
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
SIGDIAL
2010
13 years 3 months ago
2010
The second person pronoun you serves different functions in English. Each of these different types often corresponds to a different term when translated into another language. Cor...
INLG
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we propose a new shared task called HOO: Helping Our Own. The aim is to use tools and techniques developed in computational linguistics to help people writing about...
POPL
2001
ACM
14 years 6 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...