Sciweavers

89 search results - page 3 / 18
» A Resolution Calculus for Dynamic Semantics
Sort
View
KR
2000
Springer
13 years 9 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci
ESOP
2009
Springer
14 years 1 months ago
Exploring the Design Space of Higher-Order Casts
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
Jeremy G. Siek, Ronald Garcia, Walid Taha
TAMC
2010
Springer
13 years 11 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
ENTCS
2008
90views more  ENTCS 2008»
13 years 6 months ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
IANDC
2010
105views more  IANDC 2010»
13 years 4 months ago
Symmetries, local names and dynamic (de)-allocation of names
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
Vincenzo Ciancia, Ugo Montanari