4087 search results - page 32 / 818 » Sets in Types, Types in Sets |
ENTCS
2000
13 years 8 months ago
2000
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
JCT
2006
13 years 8 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
ENTCS
2007
13 years 8 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
CONCUR
1999
Springer
14 years 1 months ago
1999
Springer
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...