Sciweavers

1818 search results - page 51 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
TPHOL
1996
IEEE
14 years 29 days ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus
EUROCRYPT
2006
Springer
14 years 14 days ago
Practical Identity-Based Encryption Without Random Oracles
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems
Craig Gentry
FOSSACS
2004
Springer
14 years 16 days ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
TYPES
2007
Springer
14 years 2 months ago
A Declarative Language for the Coq Proof Assistant
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
Pierre Corbineau
ISCIS
2004
Springer
14 years 2 months ago
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
Baris Sertkaya, Halit Oguztüzün