Sciweavers

288 search results - page 36 / 58
» An algebraic generalization of Kripke structures
Sort
View
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
LISP
2006
105views more  LISP 2006»
13 years 7 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
CSL
2007
Springer
14 years 1 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
INDOCRYPT
2003
Springer
14 years 25 days ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel