3713 search results - page 141 / 743 » Constructing a Calculus of Programs |
131
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
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...
136
click to vote
ESOP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
210
click to vote
POS
1998
Springer
15 years 7 months ago
1998
Springer
This paper argues that caching, atomicity and layering are fundamental to persistent systems, and that the transactional object cache architecture, as an embodiment of these conce...
105
click to vote
SIAMMAX
2010
14 years 10 months ago
2010
The main goal of this paper is to develop a numerical procedure for construction of covariance matrices such that for a given covariance structural model and a discrepancy function...
136
Voted
MPC
2010
Springer
15 years 8 months ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...