Joseph Goguen and Jose Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417-477. MIT Press, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Programming Methodology [96, 119, 65, 50, 66, 121] 2. Declarative Specification and Programming Languages, including: Equational Languages (OBJ) 65, 49, 85, 66] Relational and Equational Languages (Eqlog) 61, 62] Multiparadigm Concurrent Object Oriented Languages (FOOPS and Maude) [63, 132, 121, 120, 122, 131, 89]; and Reflective Languages [32, 30] In 1990 Dr. Meseguer proposed rewriting logic as a new specification and programming formalism for concurrent and distributed systems. Since that time, more than sixty papers developing the rewriting logic ideas have been published by an active research ....

Joseph Goguen and Jos'e Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417--477. MIT Press, 1987.

.... different aspects of complex systems and reasoning across such formalizations (c) correct interoperation of formal tools such as theorem provers, declarative languages, and analyzers Our research will build on our previous work on module composition operations in the OBJ [32] Eqlog [29] FOOPS [31], and Maude [55] languages, and on the metalogical foundations of such composition operations on the theories of institutions and general logics [27, 54] For interoperation of formalisms, our work on reasoning theories and open mechanized reasoning systems [23, 22] and on borrowing logics [11] ....

Joseph Goguen and Jos'e Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417--477. MIT Press, 1987.

....inflexible, and every system only solves the problem of combining the particular paradigms it supports. The combination of particular paradigms can however address important theoretical problems [Fro87, Han90] Some of the multiparadigm programming languages support the object oriented paradigm [TOO86, McC92, GM87], but do this as an additional paradigm, and not as a structuring mechanism for integrating other paradigms. In our approach object orientation is used externally to the multiparadigm programming system in order to structure and encapsulate its components. Finally, an approach that can be used ....

Joseph A. Goguen and Jose Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417--477. MIT Press, 1987.

....are also tools and many theoretical frameworks to manage them. From an historic viewpoint, object oriented languages and abstract data types (ADT for short) share a common ancestor: Simula [KD66] The two techniques were developed independently, however some works have tried to merge them: FOOPS [GM87] and Eiffel [Mey88] for more detail see [GBB 97] about more recent works) The main and first approach with ADT was [HHK98b] It reuses a previous work about OMT [BC95] They use Larch Shared Language. The present work is related to these approaches but we focus on a more operational ....

Joseph A. Goguen and Jos'e Meseguer. Unifying Functional, ObjectOriented and Relational Programming with Logical Semantics, pages 417-- 477. Computer Systems Series. Bruce Shriver and Peter Wegner, Research Directions in Object-Oriented Programming, 1987.

....presence of extra methods and he also does not allow data refinement between supertype and subtype value spaces. Others have worked on the specification of types and subtypes. For example, many have proposed Z as the basis of specifications of object types[8, 12, 6] Goguen and Meseguer use FOOPS[15]; Leavens and his colleagues use Larch[22, 24, 11] Though several of these researchers separate the specification of an object s creators from its other methods, none has identified the problem posed by the missing creators, and thus none has provided an explicit solution to this problem. In ....

Joseph A. Goguen and Jose Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object Oriented Programming. MIT Press, 1987.

....and vertical refinement steps. These allow to design large programs by stepwise refinement and to decompose their correctness proofs along the refinement and module structure. A number of approaches aim at enhancing algebraic design languages with object oriented constructs, among these Foops [GM87] an extension of OBJ) GSBL [CO88] Object Z [DDRS89] Spectral [KS91] and OOZE [AG91] Wide spectrum languages provide a common framework for programs and specifications, where the class of programs is regarded as the executable subset of specifications. Extended ML [ST86] ST91] as ....

Joseph Goguen and Jos'e Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. Technical Report SRI-CSL-87-7, SRI International, 1987.

....guaranteed. 1.2.2.1 Models of mutable types Our approach is model theoretic. We capture the behaves like relation as a set of semantic properties on models of types. For this we need models of mutable types, which we refer as mutation algebras. Mutation algebras, as opposed to regular algebras [Wir90, GM87], contain stores as values. Using these stores, we model mutation as in denotational semantics. Further these algebras allow us to study observations on types independent of the language in which they are implemented. Models for mutable types are discussed in 2. 1.2.2.2 Simulation relations The ....

....about OO programs and Chapter 7 offers summary and conclusions. 11 2. ALGEBRAIC MODELS OF MUTABLE TYPES In this chapter, we develop algebraic models of mutable types. We refer to these algebras as mutation algebras. Mutation algebras are extensions of standard algebraic models of immutable types [Wir90, GM87]. There are two applications of mutation algebras in our study of behavioral subtyping for mutable types. The first is to provide an algebraic model of types that is independent of any programming language. This allows us to study relations between different types or different implementations of ....

Joseph A. Goguen and Jos'e Meseguer. Unifying functional, objectoriented and relational programming with logical semantics. In Bruce 108 Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417--477. The MIT Press, Cambridge, Mass., 1987.

....of the semantics somewhat separately. Although we have not done so, studying ways to give semantics to type and method declarations, or other languages for specifying such algebras might be fruitful. One could, for example, define the algebras not by programming, but by some specification method [18] or logic programming technique. Note especially that in Figure 8, we have given what amounts to an equational presentation of an algebra with mutable objects. The kind of mutation allowed is not just one level mutation either; that is, it is not just variables containing pure values. Because of ....

....algebraic models are based, in part, on the work of Wing [73] and Chen [8] These authors did not investigate simulation relations, or the use of mixed algebraic and denotational semantics. Several authors use Kripke (i.e. possible world) models to give semantics to mutation and object identities [18] [1] 72] 25] One could consider our algebras to be Kripke models if we were to include the store as part of the algebra. However, we believe that keeping the store outside the algebra leads to a cleaner separation of the algebra and the semantics of . More importantly, it allows the ....

Joseph A. Goguen and Jos'e Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417--477. The MIT Press, Cambridge, Mass., 1987.

....actual types, and decides what to do, as in CLOS. This is easiest to understand if the sets of denotable values of each type are disjoint, but can be made to work even if they overlap [15] We do not require carrier sets of subtypes be subsets of the carrier sets of supertypes in contrast to [4] [8]. The special abstract value 3 of sort TtoS [Void] is used for the result of an operation that would otherwise not have a value. An operation is modeled by a function from a sequence of denotable values and an initial store to a denotable value and a final store. Stores are finite functions from a ....

Joseph A. Gougen and Jose Meseguer. Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics Research Directions in Object-Oriented Programming, MIT press, Cambridge, Mass. 417-477, 1987.

No context found.

Joseph Goguen and Jose Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417-477. MIT Press, 1987.

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