22 search results - page 2 / 5 » Higher-Order Modal Logic - A Sketch |
CADE
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
ECAI
2010
Springer
13 years 4 months ago
2010
Springer
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
LMCS
2007
13 years 4 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...