Sciweavers

1174 search results - page 130 / 235
» A Logical Approach to Abstract Algebra
Sort
View
CADE
2006
Springer
15 years 10 months ago
Towards Self-verification of HOL Light
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
John Harrison
DLOG
2009
14 years 7 months ago
Revision of DL-Lite Knowledge Bases
Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communit...
Zhe Wang, Kewen Wang, Rodney W. Topor
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
FPCA
1989
15 years 2 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 10 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley