Goguen J.A. : \Abstract errors for abstract data types", Formal Description of Programming Concepts, E.J. NEUHOLD Ed., North Holland, pp.491-522, 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....there are two main approaches to describing partially defined operations: the partial algebra approach on the one hand [5, 21, 7] and total algebras with explicit definition domains or even error elements, on the other. This later approach comprises manifold variations, including error algebras [9], labeled algebras [2] ordersorted algebras [10] techniques using predicates [18] or functions [13] to specify definition domains of operations. For a closer discussion of the traditional solutions see [20] In partial algebras, an undefined term has no interpretation in the carrier. During the ....

Joseph A. Goguen. Abstract errors for abstract data types. In IFIP Working Conference on the Formal Description of Programming Concepts, volume 116, pages 89--103. NorthHolland, 1978.

....such tokenization does not call for modification of the rest of the specification. Thus, tokenization could be automatically performed by the system and hidden from the user (specifier) 6 Related work Methods to handle exceptional states in algebraic specification is a much discussed subject [9], however type errors encountered during type checking are not exceptions of this nature. Order sorted algebras [8] allow errors to be dealt in separate sorts. This by itself does not help modularization, whereas our recommended style could be used in that context. Thus specifiers of type checkers ....

J. A. Goguen. Abstract errors for abstract data types. In E.J. Neuhold, editor, Formal descriptions of programming concepts, pages 491--525. NorthHolland, 1978.

....[419] The resulting specifications are difficult to understand and too complex, due to the limitation of the logic used to express them. To avoid this drawback, ad hoc framework have been proposed, where the distinction can be stated in a more compact way, as in error specifications (see e.g. [403]) or, more recently, in guarded algebras (see e.g. 470] where the operations may be equipped with guards, and the sorts come with data constraints. An alternative point of view, providing tools for a distinction between errors and exceptions, is that terms instead of elements should be labeled ....

J. A. Goguen. Abstract errors for abstract data types. In Proc. IFIP Working Conference on the Formal Description of Programming Concepts. North-Holland, 1978.

....having to reach the inner, more detailed, layers of the model; compiler writers and language designers, on the other hand, have access to the detailed formal description they require by examining all layers of the model. The innermost layer of the model uses algebraic specifications of ADTs [6, 7, 8, 9, 11] and provides the formal basis on which the information structure model is built. This model has also proved itself amenable to the direct generation of an interpreter from the description of the semantics. In the semantic description, each language construct is described in terms of its effect on ....

J.A. Goguen. Abstract errors for abstract data types. In E.J. Neuhold (editor), Formal Descriptions of Programming Concepts, pages 491--526. North-Holland, Amsterdam, 1978.

....C.4. In [66] OBJ3 is used for teaching the semantics of imperative programming languages, and all the proofs in [66] are actually executable OBJ3 programs; see [109] for a more detailed discussion of the educational uses of OBJ. 1. 1 A Brief History of OBJ OBJ was designed in 1976 by Goguen [43], using error algebras to extend algebraic abstract data type theory with error handling and partial functions; this first design also used ideas from Clear [8, 10] for parameterized modules, thus giving birth to parameterized programming. The first implementations of OBJ were done from 1977 to ....

....as in [98] it is unsatisfactory in practice because it does not allow error messages or error recovery. For some time, we have been exploring rigorous approaches that allow users to define their own exception conditions, error messages, and exception handling. OBJT and OBJ1 used error algebras [43], which sometimes fail to have initial models [131] however, the current approach based on OSA seems entirely satisfactory to us. As a simple example, let s consider the natural and rational numbers, with sorts Nat Rat. If is only defined for rationals, then (2 2) is fine because 2 is a ....

Joseph Goguen. Abstract errors for abstract data types. In Eric Neuhold, editor, Proceedings, First IFIP Working Conference on Formal Description of Programming Concepts, pages 21.1--21.32. MIT, 1977.

....code are optimized. For an interpreted language like BOBJ, it suces to transform signatures and equations, though the transformations are still rather complex. OBJ began around 1974 as a notation for algebraic speci cation, and was soon implemented as a term rewriting interpreter. Early designs [9] had a rst order module system like that of Clear [1] later formalized as parameterized programming [10] which added default views and simpli ed syntax. Parameterized programming was rst fully implemented in OBJ3 [16] extending earlier versions of OBJ, and it appears in all members of the ....

Joseph Goguen. Abstract errors for abstract data types. In Eric Neuhold, editor, Proceedings, First IFIP Working Conference on Formal Description of Programming Concepts, pages 21.1-21.32. MIT, 1977. Also in Formal Description of Programming Concepts, Peter Neuhold, Ed., North-Holland, pages 491-522, 1979.

....the circular coinductive rewriting algorithm for proving (and disproving) coinductive assertions for such systems [12] 3. Some Related Work OBJ began around 1974 as a notation for algebraic specification, and soon after was implemented in an interpreter based on term rewriting. Early designs [8] called for a module system like that of the Clear specification language [1] and this first order approach to modularization was later formalized under the name parameterized programming, including default views, to greatly reduce the effort of writing views [9, 11] Parameterized programming ....

Joseph Goguen. Abstract errors for abstract data types. In Eric Neuhold, editor, Proceedings, First IFIP Working Conference on Formal Description of Programming Concepts, pages 21.1--21.32. MIT, 1977.

....motivation is to correctly handle erroneous and meaningless expressions, such as the top of an empty stack or division by zero. This has been an important problem from the earliest days of the algebraic approach to abstract data types [35] Error algebra was a first try at a more elegant solution [17], but unfortunately error algebra specifications do not always have initial algebras [65] OSA, which originated in [18] provides what now seems a fully satisfactory and very flexible approach that provides: 1. Several forms of polymorphism and overloading; 2. Error definition, detection and ....

Joseph Goguen. Abstract errors for abstract data types. In Eric Neuhold, editor, Proceedings, First IFIP Working Conference on Formal Description of Programming Concepts, pages 21.1-- 21.32. MIT,

No context found.

Goguen J.A. : \Abstract errors for abstract data types", Formal Description of Programming Concepts, E.J. NEUHOLD Ed., North Holland, pp.491-522, 1978.

No context found.

Joseph A. Goguen. Abstract errors for abstract data types. In Erich J. Neuhold, editor, Formal Description of Programming Concepts, pages 491--525. North-Holland Publishing Company, Amsterdam, The Netherlands, 1978.

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