691 search results - page 61 / 139 » Equational Abstractions |
157
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
168
click to vote
POPL
1995
ACM
15 years 10 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
167
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
190
Voted
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes ...
182
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...