199 search results - page 17 / 40 » Denotations for Classical Proofs - Preliminary Results |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Deep Neural Networks (DNNs) denote multilayer artificial neural networks with more than one hidden layer and millions of free parameters. We propose a Generalized Discriminant An...
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
PODS
1997
ACM
13 years 11 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
EUROCRYPT
2010
Springer
14 years 13 days ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
ENTCS
2008
13 years 7 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...