385 search results - page 46 / 77 » Extensionality in the Calculus of Constructions |
ANTS
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
101
click to vote
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs...
TYPES
2004
Springer
15 years 3 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...