Sciweavers

67 search results - page 3 / 14
» A Proof Theory for Generic Judgments: An extended abstract
Sort
View
SCP
2011
255views Communications» more  SCP 2011»
13 years 13 days ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
LICS
1998
IEEE
13 years 9 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
CADE
2011
Springer
12 years 5 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 5 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
ASIACRYPT
2008
Springer
13 years 7 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...