Sciweavers

91 search results - page 7 / 19
» Reducts of Propositional Theories, Satisfiability Relations,...
Sort
View
AIML
2004
13 years 9 months ago
A Systematic Proof Theory for Several Modal Logics
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
Charles Stewart, Phiniki Stouppa
ENTCS
2002
129views more  ENTCS 2002»
13 years 7 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
ICFP
2002
ACM
14 years 7 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
POPL
2012
ACM
12 years 3 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote