P. Mosses, : "Unified algebras and action semantics", In Proc. STACS'89, 6th Symp. on Theoritical Aspects of Computer Sciences, February 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of a specification SP satisfy the same formula of L neq (SP) Some of the more recent work on algebraic specifications of nondeterminism bears some similarities to the approach presented in this paper. An elegant construction unified algebras has been proposed by Mosses in [Mosses 1989a, Mosses 1989b] The unified algebras provide quite general and flexible semantic tools. Nondeterministic choice is modeled as a separate sort comprising exactly the possible results. This is very similar to our nondeterministic constants. The language allows variables to refer to arbitrary applications of ....

Mosses, P.D., "Unified Algebras and Action Semantics", in STACS`89, LNCS, vol. 349, Springer, 1989.

....of applying the theory of initiality to the new domain of nondeterminism. The presentation is rather informal. We will present a simple, yet illustrative, example and work it out in different formalisms. The models we will consider are multialgebras [3,4,7] computations [15] and unified algebras [11,12]. In each case we will give a short description of the language used. We will have in mind only initial models, and the interpretation of a ground term t in such a model will be denoted H(t) or t. The example itself was used in [11] but has certainly been contemplated by anybody devoting a few ....

....[3,4,7] computations [15] and unified algebras [11,12] In each case we will give a short description of the language used. We will have in mind only initial models, and the interpretation of a ground term t in such a model will be denoted H(t) or t. The example itself was used in [11], but has certainly been contemplated by anybody devoting a few minutes thought to nondeterminism. We are particularly thankful to Vladimir Antimirov for his comments and discussion of it in the context of unified algebras. Having explored the example using multialgebras, computations and ....

[Article contains additional citation context not shown here]

Mosses, P.D., "Unified Algebras and Action Semantics", in STACS'89, vol. 349, LNCS, Springer, 1989.

....Moreover, it has been found to be very well suited for generating compilers [5, 56, 58] and interpreters [69] Thus the pragmatic aspects of action semantics seem to be satisfactory. 13 5 Foundations The foundations of action semantics are based on the framework of unified algebras [37, 38, 39]: each part of an ASD is interpreted as a unified algebraic specification. The signature of a unified algebra is simply a ranked alphabet. The universe of a unified algebra is a (distributive) lattice with a bottom value, together with a distinguished subset of individuals. The operations of a ....

P. D. Mosses. Unified algebras and action semantics. In STACS'89, Proc. Symp. on Theoretical Aspects of Computer Science, Paderborn, volume 349 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

....of a specification SP satisfy the same formula of L neq (SP) Some of the more recent work on algebraic specifications of nondeterminism bears some similarities to the approach presented in this paper. An elegant construction unified algebras has been proposed by Mosses in [Mosses 1989a, Mosses 1989b] The unified algebras provide quite general and flexible semantic tools. Nondeterministic choice is modeled as a separate sort comprising exactly the possible results. This is very similar to our nondeterministic constants. The language allows variables to refer to arbitrary applications of ....

Mosses, P.D., "Unified Algebras and Action Semantics", in STACS`89, LNCS, vol. 349, Springer, 1989.

....[158, 146, 148, 147, 198, 159, 155, 154] Action semantics of concurrency constructs have been developed [147, 149, 157] With Dr. A. van Deursen he has created translation and checking tools for action semantics [191] Mosses has developed the novel specification framework of unified algebras [144, 142, 143, 150, 152] specifically to facilitate datatype specification in action semantics, where it is desirable to be able to use type union and other type constructors in an algebraic setting. Since 1995, Mosses has been overall coordinator of CoFI (the Common Framework Initiative for algebraic specification and ....

Peter D. Mosses. Unified algebras and action semantics. In STACS'89, Proc. Symp. on Theoretical Aspects of Computer Science, Paderborn, volume 349 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

....two reasons why one might want to include the concept of nondeterminism in the traditional algebraic specification methods: 1) Real nondeterminism. The system being specified really is nondeterministic its behavior is not fully prewhich is beyond the scope of this paper. 1 Unified algebras [18,19] of P.D.Mosses, and rewriting logic [16,15] of J.Meseguer handle both kinds of parameters. However, they do it in a highly non standard, albeit elegant, way. We feel that multi and power algebras stay closer to the traditional algebraic framework. 3 dictable, nor fully reproducible. 2) ....

....example is discussed in more detail in [23] Finally, we can mention that the close relation between nondeterministic terms and sets makes it possible to use the former to define and handle subsorting directly at the term level. This is the basic intuition behind the framework of unified algebras [18,19] and can also be done within the formalism we have introduced here. 9 5. The calculus NEQ The last axiom in the merge example 4.2 uses the variable r to specify the desired properties of each possible result produced by the M operator. It says that any such r is obtained by taking the first ....

Mosses, P.D., "Unified Algebras and Action Semantics", in STACS`89, LNCS, vol. 349, Springer, 1989.

.... can be represented as the substitution system of some specification in term declaration equational logic [1] 6 Unified Algebra The unified algebra of Mosses [38] is an unorthodox approach to ordered sorting, motivated by a desire to handle nondeterminism in programming language semantics [39, 37]. The main idea is to make no distinction between sorts and elements. Thus, the values in a carrier of an unified algebra represent not only elements of data, but also classifications of elements into sorts. In this way, the theory of unified algebras is technically unsorted, because a unified ....

Peter Mosses. Unified algebras and action semantics. In Proceedings, Symposium on Theoretical Aspects of Computer Science. Springer, 1989. Lecture Notes in Computer Science, Volume 349.

....generated compilers emit code that run at least two orders of magnitude slower than corresponding target programs produced by handwritten compilers. The specification and proof of correctness of the Cantor system is an experiment in using the framework of unified algebras, developed by Mosses [35, 33, 34]. Unified algebras allows the algebraic specification of both abstract data types and operational semantics in a way such that initial models are guaranteed to exist, except when axioms contradict constraints, in which case no models of the specification exist. We have demonstrated that also a ....

....that does not perform run time type checking. The Cantor system is based on the use of such a machine language. 3 The Cantor System Our compiler generator accepts action semantic descriptions. Action semantics is a framework for formal semantics of programming languages, developed by Mosses [31, 32, 33, 36, 37] and Watt [38, 63] It is intended to allow useful semantic descriptions of realistic programming languages, and it is compositional, like denotational semantics. It differs from denotational semantics, however, in using semantic entities called actions, rather than higher order functions. We have ....

Peter D. Mosses. Unified algebras and action semantics. In Proc. STACS'89, pages 17--35. Springer-Verlag (LNCS 349), 1989.

....with permanent information: communicative actions send and receive messages, and contract work to agents. The advantage of this modularity and separability is that action semantic specifications are very easily modified and extended. The formal basis for action semantics lies in unified algebras[32]. 2.1.5 Problems with Semantic Definitions The difficulties of providing formal semantics for real world programming languages are well documented[28] Most of the issues here are due to cases where formal semantics have been devised for an extant, informally defined language. The formal ....

P.D. Mosses. Unified algebras and action semantics. In Symposium on the Theory of Automata and Computer Science. Springer-Verlag, 1989.

....trades speed for correctness, but still produces better code than the classical systems of Mosses, Paulson, and Wand. 3 The Cantor System Our compiler generator accepts action semantic descriptions. Action semantics is a framework for formal semantics of programming languages, developed by Mosses [19, 20, 21, 24, 25] and Watt [26, 45] It is intended to allow useful semantic descriptions of realistic programming languages, and it is compositional, like denotational semantics. It differs from denotational semantics, however, in using semantic entities called actions, rather than higher order functions. We ....

....semantics to both action notation and the abstract RISC machine language. 2. Make the compiling of action notation simple; and 3. Use a variation of Despeyroux s proof technique [4] All specifications are given using unified algebras, an algebraic specification framework developed by Mosses [23, 21, 22]. This includes the semantics of action notation (13 pages) the semantics of the machine language (6 pages) the compiler (36 pages) and various auxiliary notation (14 pages) The correctness statement, including various lemmas but without proofs, takes 28 pages. Putting further sophistication ....

Peter D. Mosses. Unified algebras and action semantics. In Proc. STACS'89, pages 17--35. Springer-Verlag (LNCS 349), 1989.

....way of presenting overloading may clarify some controversial aspects. We have concentrated our effort to the analysis of the following structures: Many Sorted Algebra [27, 2, 24, 22, 10] universal Order Sorted Algebra [11, 42, 47] overloaded Order Sorted Algebra [15, 23, 18] Unified Algebra [37, 36, 38] and Heterogeneous Unified Algebra [41] a novel framework holding, in a sense, both a syntactic and a semantic notion of sort. We found that all issues concerning classifications raised by other models, including partial ones, are covered by the structures considered. For example, Equational Type ....

....make for UA is valid also for the other two structures; UA is easy to describe, and allows a better introduction of the structure of HUA (based on UA) which differs from the other universal structures for supporting both static and dynamic classifications. 6. 1 Unified Algebra Unified Algebra [37, 36, 38], originally developed by Mosses for his action semantics [39] is based on an illuminating idea: elements and sorts are treated in a unified way they are values. It turns out that sorts have an intensional meaning, in fact if elements and sorts are treated in a unified way we have that ....

Peter D. Mosses. Unified algebras and action semantics. In Proceedings, Symposium on Theoretical Aspects of Computer Science. Springer, 1989. Lecture Notes in Computer Science, Volume 349.

....simpler way: by partial evaluation of an action interpreter. Even though our compiler produces Scheme code, the code runs as fast as that produced by the previous action compilers. 1 Introduction Action semantics is a framework for formal semantics of programming languages, developed by Mosses [16, 17, 18] and Watt [19, 26] It differs from denotational semantics in using semantic entities called actions, rather than higher order functions. Compiler generation based on action semantics has been studied by Brown, Moura, and Watt [6] and also by the second author [22, 20, 21] Journal of Functional ....

Peter D. Mosses. Unified algebras and action semantics. In Proc. STACS'89, pages 17--35. Springer-Verlag (LNCS 349), 1989.

....to commercial compilers, and that also do not interface to commercial productquality parsers or code generators. The situation has gradually improved through the work of several researchers, e.g. Sethi [25] Paulson [15] Raskovsky [20] Wand [30] Appel[1] Jouvelot[9] and later work by Mosses [13], until Lee [11] and Petterson [16] demonstrated the first practical compiler generation systems accepting denotational specifications. In comparison with the MESS [11] system, the DML system goes several steps further. It interfaces well with standard tools and it automatically generates a code ....

Peter Mosses. Unified Algebras and Action Semantics. In Proc. Symp. of Theor. Sci. (STACS'89), LNCS-349, 1989.

No context found.

P. Mosses, : "Unified algebras and action semantics", In Proc. STACS'89, 6th Symp. on Theoritical Aspects of Computer Sciences, February 1989.

No context found.

Mosses, P.D., Unified Algebras and Action Semantics, in Monien, B. and Cori, R. (Eds.), Proceedings of 6th Annual Symposium on Theoretical Aspects of Computet Science, Springer-Verlag, 1986.

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