Sciweavers

12774 search results - page 144 / 2555
» A Framework for Proof Systems
Sort
View
LICS
2008
IEEE
15 years 10 months ago
Mechanizing the Metatheory of LF
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
Christian Urban, James Cheney, Stefan Berghofer
CSFW
2006
IEEE
15 years 10 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
RTA
2004
Springer
15 years 9 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
FOSSACS
2008
Springer
15 years 6 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
SEMWIKI
2008
134views Data Mining» more  SEMWIKI 2008»
15 years 5 months ago
A Real Semantic Web for Mathematics Deserves a Real Semantics
Abstract. Mathematical documents, and their instrumentation by computers, have rich structure at the layers of presentation, metadata and semantics, as objects in a system for form...
Cezary Kaliszyk, Pierre Corbineau, Freek Wiedijk, ...