10916 search results - page 294 / 2184 » On Constructive Connectives and Systems |
237
click to vote
RTA
2005
Springer
16 years 27 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
167
click to vote
TCC
2007
Springer
16 years 1 months ago
2007
Springer
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). These systems support...
161
click to vote
WORDS
2003
IEEE
16 years 20 days ago
2003
IEEE
The paper presents an UML profile which defines a language for specifying, visualizing, analysing and documenting dependability mechanisms. It helps to cope with the complexity of...
281
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...