14 search results - page 3 / 3 » Ultimate Normal Forms for Parallelized Natural Deductions |
CONCUR
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
COLING
1996
13 years 6 months ago
1996
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
TCS
2011
12 years 11 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...