K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th ACM Symp. on Principles of Programming Languages, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the events that it may raise. However, each such interface can be specified separately. A component may not be self contained, but may have some requirements on the context in which it must be used. However, one can treat these dependencies as extra parameters, as, for example, is done in OBJ [FGJM85, Gog84] and the RESOLVE family of specification languages [SWO97] A component will raise events (i.e. invoke callbacks) during execution of its operations, for example when its instances experience state changes. Traditional specification languages ignore such higher order behavior, ....

Futatsugi, K., Goguen, J. A., Jouannaud, J.-P., and Meseguer, J. Principles of OBJ2. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 52--66. ACM, January 1985.

....properly (i.e. it is normalizing, optimal, etc. for particular classes of programs. Thus, the designers of some programming languages have included language constructs aimed at giving more flexible control of the program execution. For instance, programming languages such as Maude [5] OBJ2 [8], OBJ3 Work partially supported by CICYT TIC2001 2705 C03 01 and MCYT Acci on Integrada HU 2001 0019. 13] and CafeOBJ [10] admit the explicit specification of a particular class of strategy annotations (called E strategies [7] which are lists of integers associated to function symbols which ....

....simple interface for understanding and eventually modifying the execution of programs. The E strategies permit us to completely avoid the evaluation of some arguments of function symbols. For instance, OBJ2 (and OBJ3) built in conditional operator has the following (implicit) strategy annotation ([8], Sec. 4.4; 13] Sec. 2.4.4 Ap. D.3) op ifthenelsefi : Bool Univ Univ Univ [strat (1 0) which says to evaluate the first argument until it is reduced, and then apply rules at the top (indicated by 0 ) No evaluation is performed on the second and third arguments . The presence of ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985.

....as Lisp, OBJ , CafeOBJ, ELAN, or Maude evaluate expressions by innermost rewriting. Since nontermination is a known problem of innermost reduction, syntactic annotations (generally speci ed as sequences of integers associated to function arguments, called local strategies) have been used in OBJ2 [FGJM85] OBJ3 [GWM 00] CafeOBJ [FN97] and Maude [CELM96] to improve eciency and (hopefully) avoid nontermination. Local strategies are used in OBJ programs for guiding the evaluation strategy (abbr. E strategy) when considering a function call f(t 1 ; t k ) Work partially supported ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66. ACM Press, 1985. 17

....F discriminates, for each symbol of the signature, the argument positions on which replacements are allowed [28] In this way, the termination behavior of rewriting computations can be improved, e.g. by pruning all the infinite rewrite sequences. In eager programming languages such as OBJ2 [14], OBJ3 [20] CafeOBJ [15] and Maude [6] it is possible to specify the socalled strategy annotations for controlling the execution of programs. For instance, the OBJ3 program in Figure 1 (borrowed from [2] specifies an explicit strategy annotation (1) for the list constructor cons which ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages (POPL'85), pages 52--66. ACM Press, 1985.

.... type discipline combines the notion of parametric polymorphism [Mil78, DM82] which has been developed for higherorder functional programming [HMM86] with the notion of order sorted typing [Gog78, GM87a, SNGM89] which has been developed for equational first order specification and programming [FGJM85] Both notions are important for practical reasons. With parametric polymorphism one avoids the need for redefining lists and other parametric data types for every type they are used with. Subsorts not only provide for more natural type specifications, but also yield more computational power: ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In B. Reid, editor, Proceedings of 12th ACM Conference on Principles of Programming Languages, pages 52--66. ACM, 1985.

.... For instance, the so called strategy annotations have been used in the OBJ family of languages to introduce replacement restrictions aimed at improving the efficiency of computations (by reducing the number of attempted matchings) Their usefulness has been demonstrated in practice: in [FGJM85] the authors remark that, due to their use in OBJ2 programs, the ratio between attempted matches and successful matches is usually around 2=3, which is really impressive . For instance, OBJ s built in conditional operator has the following (implicit) strategy annotation ( FGJM85] Section ....

....practice: in [FGJM85] the authors remark that, due to their use in OBJ2 programs, the ratio between attempted matches and successful matches is usually around 2=3, which is really impressive . For instance, OBJ s built in conditional operator has the following (implicit) strategy annotation ( FGJM85] Section 4.4, GWMFJ00] Section 2.4.4) op ifthenelsefi : Bool Int Int Int [strat (1 0) As in [GWMFJ00] by OBJ we mean OBJ2, OBJ3, CafeOBJ, or Maude. A more precise and general definition can be found in OBJ3 s standard prelude, see Appendix D.3 of [GWMFJ00] which says to evaluate ....

[Article contains additional citation context not shown here]

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985.

....as Lisp, OBJ , CafeOBJ, ELAN, or Maude evaluate expressions by innermost rewriting. Since nontermination is a known problem of innermost reduction, syntactic annotations (generally specified as sequences of integers associated to function arguments, called local strategies) have been used in OBJ2 [FGJM85] OBJ3 [GWM 00] CafeOBJ [FN97] and Maude [CELM96] to improve efficiency and (hopefully) avoid nontermination. Local strategies are used in OBJ programs for guiding the evaluation strategy (abbr. E strategy) when considering a function call f(t 1 ; t k ) Work partially ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52--66. ACM Press, 1985. 17

....innermost termination of CSR using existing methods for proving termination of CSR. Keywords: Rewriting strategies, termination. 1 Introduction Strategy annotations (e.g. lists of integers that are associated to the symbols of the signature) are used in programming languages such as OBJ2 [FGJM85], OBJ3 [GWMFJ00] CafeOBJ [FN97] and Maude [CELM96] to introduce replacement restrictions aimed at improving termination ( GWMFJ00] Section 2.4.4) Example 1. The following OBJ3 program (borrowed from [OF97] obj EXAMPLE is sorts Sort . op 0 : Sort . op s : Sort Sort . op : Sort ....

....computations controlled by strategy annotations. Strategy annotations can be given different shapes and computational interpretations. Following Visser s recent classification [Vis01] we consider the following computational strategies which are associated to strategy annotations: 1. E strategy [FGJM85,Eke98], which permits us to completely avoid the evaluation of some arguments of function symbols (in an ordered way) 2. Just in time (by van de Pol [Pol01] which is designed to delay the evaluation of arguments as much as possible. We show that context sensitive rewriting (CSR, a simple ....

[Article contains additional citation context not shown here]

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985.

....replacement restrictions to become more lazy thus (hopefully) avoiding nontermination. For instance, FW76] studied implementations of Lisp where the list constructor operator (cons) did not evaluate its arguments, during certain stages of the computation. Also, algebraic languages, such as OBJ2 [FGJM85], OBJ3 [GWMFJ00] CafeOBJ [FN97] or Maude [CELM96] admit the explicit specification of strategy annotations as sequences of integers in parentheses. They are interpreted as replacement restrictions that constrain an underlying eager evaluation strategy: an argument t i of a function call f(t 1 ; ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985. 19

....F discriminates, for each symbol of the signature, the argument positions on which replacements are allowed [28] In this way, the termination behavior of rewriting computations can be improved, e.g. by pruning all the infinite rewrite sequences. In eager programming languages such as OBJ2 [14], OBJ3 [20] CafeOBJ [15] and Maude [6] it is possible to specify the socalled strategy annotations for controlling the execution of programs. For instance, the OBJ3 program in Figure 1 (borrowed from [2] specifies an explicit strategy annotation (1) for the list constructor cons which ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages (POPL'85), pages 52--66. ACM Press, 1985.

....annotations. Then, we define a program transformation methodology for (correct and) complete evaluations which applies to OBJ like languages. Keywords: Declarative programming, OBJ, strategy annotations. 1 Introduction Strategy annotations are used in the OBJ family of languages (OBJ2 [FGJM85], OBJ3 [GWMFJ00] CafeOBJ [FN97] and Maude [CELM96] to avoid nontermination ( GWMFJ00] Section 2.4.4) obj EXAMPLE is sorts Nat LNat . op 0 : Nat . op s : Nat Nat [strat (1 0) op nil : LNat . op cons : Nat LNat LNat [strat (1 0) op from : Nat LNat [strat (1 0) ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of POPL'85, pages 52-66, ACM Press, 1985.

....the last two decades, algebraic specification has frequently been used to study denotational semantics of functional [6, 55] and imperative [7] languages. Algebraic specification languages inherently provide algebraic semantics and thus mathematical objects denoting syntactical constructs (c.f. [8, 27, 21, 12, 5, 57, 25]) Algebraic semantics are also used in the field of abstract state machines to formalize the machine model underlying an operational semantics [31] Based on this approach, Gurevich shows such a semantics for the C programming language [32] In the context of algebraic specification languages, a ....

J.A. Goguen, K. Futatsugi, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Principles of Programming Languages, ACM SIGPLAN Notices, pages 52 -- 66, 1985.

....which binds any process algebra with any algebraic specification formalism. We detail this single suggestion since it includes the two others. We begin with a quick survey of the formalisms concerned by this extension. For algebraic specifications, there are mainly ACT ONE [17] ASF [4] OBJ [19, 22], ASL [52] Larch [24] CLEAR [9] PLUSS [6] CASL [15] etc. Concerning process algebras, we cite CCS [36] CSP [26] ACP [5] basic LOTOS [7] calculus [37, 38] etc. Generalization of the Algebraic Specification Language A first idea is to conserve the CASL formalism as a target language. ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ-2. In B. Reid, ed., Proceedings 12th ACM Symp. on Principles of Programming Languages, pages 52--66. Association for Computing Machinery, 1985.

....[6] list a number of features which they argue are essential for OO database systems. Parallel to this, a number of formalizations of OO models have been proposed, such as COL [1, 2, 3] F logic [33] HILOG [13] ILOG [29] IQL [4, 5] formalizations of 02 [36, 35] OBJ and related languages [20, 21, 22, 23, 25, 38], OBLOG [15, 19, 17, 43] and CMSL [50, 46] Beeri [9] gives a survey of some issues. Even though these papers are top down, there is not yet any root concept from which they develop their formalization of object orientation. The trees of possibilities they explore have different roots and are ....

K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Symposium on Principles of Programming Languages, pages 566. ACM, 1985.

....them as replacement restrictions to become more lazy thus (hopefully) avoiding nontermination. For instance, FW76] studied implementations of Lisp where the list constructor operator cons did not evaluate its arguments, during certain stages of the computation. Algebraic languages, such as OBJ2 [FGJM85], OBJ3 [GWMFJ00] CafeOBJ [FN97] or Maude [CELM96] admit the specification of local strategies which are sequences of integers in parentheses. Replacement restrictions have demonstrated their usefulness in practice, since they actually improve efficiency of computations by reducing the number of ....

....[FN97] or Maude [CELM96] admit the specification of local strategies which are sequences of integers in parentheses. Replacement restrictions have demonstrated their usefulness in practice, since they actually improve efficiency of computations by reducing the number of attempted matchings (see [FGJM85]) However, the possibility of introducing replacement restrictions should be made available together with some additional formal support allowing the programmer a clear (and simple) understanding of their influence on the operational behavior of the program. In [Luc01] we have introduced ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985.

....e.mail: slucas dsic.upv.es Eager rewriting based languages such as Lisp, OBJ , CafeOBJ, ELAN, or Maude use innermost rewriting to evaluate initial expressions. A frequent problem here is nontermination. Syntactic annotations (i.e. associated to the arguments of symbols) have been used in OBJ2 [FGJM85], OBJ3 [GWMFJ00] CafeOBJ [FN97] or Maude [CELM96] as replacement restrictions to (hopefully) avoid nontermination. Within the program text, they are specified as sequences of integers in parentheses called local strategies. For instance, the following OBJ3 program: obj EXAMPLE is sorts Sort . ....

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66, ACM Press, 1985.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th ACM Symp. on Principles of Programming Languages, 1985.

No context found.

K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, and J. Meseguer:. Principles of OBJ2. In 12th Int. Conf. Principles of programming languages (POPL), pages 52-66, New Orleans, Louisiana, Jan 1985. ACM, New York.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of 12th Annual ACM Symp. on Principles of Programming Languages (POPL'85), pages 52--66. ACM Press, New York, 1985.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52--66. ACM Press, 1985.

No context found.

Futatsugi, K., Goguen, J., Jouannaud, J.-P., and Meseguer, J. Principles of OBJ-2. In 12th Ann. Symp. on Principles of Programming (1985), ACM, pp. 52-66.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of 12th Annual ACM Symp. on Principles of Programming Languages (POPL'85), pages 52--66. ACM Press, New York, 1985.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, pages 52-66. ACM Press, 1985.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of POPL'85, pages 52-66, ACM Press, 1985.

No context found.

K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages (POPL'85), pp. 52--66. ACM Press, 1985.

First 50 documents  Next 50

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