1175 search results - page 7 / 235 » Abstract computability and algebraic specification |
CSUR
1999
13 years 7 months ago
1999
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
SOFSEM
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau
AMAST
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. One of the most novel features of Casl, the Common Algebraic Specification Language, is the provision of so-called architectural specifications for describing the modular...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
ility concepts in abstract data type specification, 30 years later Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburg...