1385 search results - page 89 / 277 » Natural Rewriting for General Term Rewriting Systems |
145
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
127
click to vote
FAC
2008
15 years 6 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
200
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
165
click to vote
SIGSOFT
2001
ACM
16 years 7 months ago
2001
ACM
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such ev...
161
click to vote
FROCOS
2007
Springer
16 years 10 days ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...