Sciweavers

MFCS
2005
Springer
14 years 2 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
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...
Martin Lange, Rafal Somla