Sciweavers

136 search results - page 12 / 28
» Typed Logical Variables in Haskell
Sort
View
TPHOL
2009
IEEE
14 years 3 months ago
The HOL-Omega Logic
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
Peter V. Homeier
POPL
2010
ACM
14 years 6 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 8 months ago
Join Bayes Nets: A new type of Bayes net for relational data
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
CADE
2006
Springer
14 years 9 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
PPCP
1993
14 years 22 days 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