999 search results - page 37 / 200 » On the Decidability of Functional Uncertainty |
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
ESOP
2009
Springer
15 years 1 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...