Maura Cerioli. A lazy approach to partial algebras. In E. Astesiano, G. Reggio, and A Tarlecki, editors, Recent Trends in Data Type Specification: 10th Workshop on Specification of Abstract Data Types-Selected Papers, volume 906 of Lecture Notes in Computer Science. Springer, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....when the specification approaches the implementation level and explicit error handling becomes desirable. Strictness of all operations makes explicit error handling very difficult, if at all possible. Possible extensions of partial algebras to handle this level of specification are indicated in [7, 6]. Often, they suggest some form of translation of a partial algebra specification into some total framework [7] The approaches based on total algebras explore the possibilities of explicit error handling, by allowing for values which can be used as error values. 1 The error elements solution ....

....in multialgebras) offer a high level abstraction mechanism. In particular, the underlying strictness assumption releases one from detailed treatment of various error situations. On the other hand, however, there are non strict operations (like if then else) which then require special treatment [6, 7]. More generally, the abstract character of partial algebra formalism does not handle the problems encountered when the specification approaches the implementation level and where explicit error handling may be desirable. At this stage, one will typically recommend a totalisation of a partial ....

Maura Cerioli. A lazy approach to partial algebras. In E. Astesiano, G. Reggio, and A Tarlecki, editors, Recent Trends in Data Type Specification: 10th Workshop on Specification of Abstract Data Types-Selected Papers, volume 906 of Lecture Notes in Computer Science. Springer, 1995.

....tricky. In [78] the labeling is proposed on terms instead than on values, in order to capture the intuition that the same value can be denoted by both a correct and an exceptional term. Going a step further in the direction of formalizing the intuition that errors are due to term evaluation, in [195] is introduced a rigorous way to represent simplification. The technical counterpart is endowing any (partial) algebra with a congruence on terms (built from the elements of the algebra as variables) representing the shortcuts that can be made during the evaluation process. Correspondingly the ....

M. Cerioli. A Lazy Approach to Partial Algebras. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specifications. 10th Workshop on Specification of Abstract Data Types, pages 188--202. Springer LNCS 906, 1995. \Phi.

....partial first order logic along these lines is developed in [GL97] It uses total variable valuations (corresponding to our j= t ) and has a special constant denoting undefined. A monotonicity requirement is not imposed. A completely different point of view on non strictness is presented in [Cer95] where the intuition is that non strictness comes from evaluational issues and is not inherent to the underlying data type. Thus, the idea is to keep as models standard partial algebras, but each one is equipped with a total congruence on terms, representing the simplifications that are done on ....

M. Cerioli. A lazy approach to partial algebras. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification: 10th Workshop on Specification of Abstract Data Types -- Selected Papers, volume 906 of Lecture Notes in Computer Science, pages 188-- 202. Springer, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC