797 search results - page 48 / 160 » Eliminating Proofs from Programs |
154
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
105
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
118
click to vote
TABLEAUX
2009
Springer
15 years 7 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
139
click to vote
TRIER
2002
15 years 10 days ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
102
Voted
CONCUR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...