Sciweavers

66 search results - page 11 / 14
» Closed fragments of provability logics of constructive theor...
Sort
View
ICFP
2002
ACM
14 years 7 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
LOGCOM
2007
125views more  LOGCOM 2007»
13 years 7 months ago
Epistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
ICFP
2005
ACM
14 years 7 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote