Sciweavers

12 search results - page 3 / 3
» A Logical Characterisation of Linear Time on Nondeterministi...
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 5 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
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...
Roland Axelsson, Martin Lange, Rafal Somla
NJC
2000
169views more  NJC 2000»
13 years 5 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann