Sciweavers

265 search results - page 13 / 53
» How to Prove Inductive Theorems
Sort
View
CSL
2010
Springer
13 years 8 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
JCS
2010
112views more  JCS 2010»
13 years 6 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
SAC
2010
ACM
13 years 2 months ago
Similar triangles and orientation in plane elementary geometry for Coq-based proofs
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
Tuan Minh Pham
APAL
2006
73views more  APAL 2006»
13 years 7 months ago
Compactness in locales and in formal topology
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
Steven J. Vickers
PPCP
1993
13 years 11 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning