229 search results - page 34 / 46 » Natural Language Proof Explanation |
121
click to vote
IFM
2007
Springer
15 years 8 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
116
Voted
COMSWARE
2006
IEEE
15 years 8 months ago
2006
IEEE
ing a middleware abstraction layer into wireless sensor networks is a widely accepted solution to facilitate application programming and allow network organization. In this paper,...
119
click to vote
MPC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
129
click to vote
ICTL
1994
15 years 6 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
112
click to vote
SAS
1993
Springer
15 years 5 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...