1916 search results - page 202 / 384 » Reasoning with class algebra |
139
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
134
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Parallel programming continues to be difficult and error-prone, whether starting from specifications or from an existing sequential program. This paper presents (1) a methodology f...
147
click to vote
TPHOL
1998
IEEE
15 years 8 months ago
1998
IEEE
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
117
click to vote
LOPSTR
1998
Springer
15 years 8 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
139
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...