221 search results - page 15 / 45 » Heyting Algebras and Formal Languages |
184
click to vote
ETRICS
2006
15 years 10 months ago
2006
To cope with the complex requirements imposed on the processing of privacy-sensitive data within enterprises, the use of automatic or semi-automatic tools is gradually becoming in...
140
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
314
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
180
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
146
click to vote
APLAS
2004
ACM
16 years 3 days ago
2004
ACM
In many occasions would one encounter the task of maintaining the consistency of two pieces of structured data that are related by some transform — synchronising bookmarks in diï...