325 search results - page 43 / 65 » Proofs of Restricted Shuffles |
165
click to vote
COCO
2011
Springer
14 years 4 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
164
click to vote
POPL
2012
ACM
13 years 12 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
135
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
157
click to vote
TLDI
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
138
click to vote
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...