Sciweavers

1650 search results - page 4 / 330
» Information Modeling and Higher-order Types
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Retrievability: an evaluation measure for higher order information access tasks
Evaluation in Information Retrieval (IR) has long focused on effectiveness and efficiency. However, new and emerging access tasks now demand alternative evaluation measures which ...
Leif Azzopardi, Vishwa Vinay
LMCS
2007
132views more  LMCS 2007»
13 years 7 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
FSTTCS
1998
Springer
13 years 11 months ago
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
Jean-Pierre Talpin, David Nowak
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
13 years 11 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
FOSSACS
2009
Springer
14 years 2 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong