3481 search results - page 302 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
155
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
152
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
156
click to vote
LOPSTR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
140
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
254
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...