An Introduction to OBJ 3

OBJ 3 is a new implementation of the OBJ language, with a new efficient operational semantics based on order-sorted term-rewriting. OBJ is a declarative language, with mathematical semantics given by order-sorted equational logic; its statements are equations that state properties the solution should have; i.e., they describe the problem to be solved. In addition, OBJ has a uniquely powerful generic module mechanism, including non-executable “theories” as well as executable “objects,” plus “module expressions” that describe and construct whole subsystems. OBJ also has user-definable abstract data types with user-definable mixfix syntax and a powerful and flexible type system that supports overloading and subtypes. OBJ is thus a wide-spectrum language that elegantly integrates coding, specification and design into a single framework.

[1]  José Meseguer,et al.  Parameterized programming in OBJ2 , 1987, ICSE '87.

[2]  José Meseguer,et al.  PROGRAMMING WITH PARAMETERIZED ABSTRACT OBJECTS IN OBJ. , 1983 .

[3]  Joseph A. Goguen,et al.  Parameterized Programming , 1984, IEEE Transactions on Software Engineering.

[4]  José Meseguer,et al.  EQLOG: Equality, Types, and Generic Modules For Logic Programming , 1986, Logic Programming: Functions, Relations, and Equations.

[5]  Jean-Pierre Jouannaud,et al.  Operational Semantics for Order-Sorted Algebra , 1985, ICALP.

[6]  D. Coleman,et al.  The design of a rewrite rule interpreter from algebraic specifications , 1987 .

[7]  José Meseguer,et al.  Operational Semantics of OBJ-3 (Extended Abstract) , 1988, ICALP.

[8]  José Meseguer,et al.  Extensions and foundations of object-oriented programming , 1986, OOPWORK '86.

[9]  José Meseguer,et al.  Concurrent term rewriting as a model of computation , 1986, Graph Reduction.

[10]  José Meseguer,et al.  Models and Equality for Logical Programming , 1987, TAPSOFT, Vol.1.

[11]  Thomas Johnsson,et al.  Target code generation from G-machine code , 1987, Graph Reduction.

[12]  José Meseguer,et al.  Remarks on remarks on many-sorted equational logic , 1987, SIGP.

[13]  José Meseguer,et al.  Remarks on remarks on many-sorted algebras with possibly emtpay carrier sets , 1986, Bull. EATCS.

[14]  José Meseguer,et al.  Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..

[15]  S. Sridhar,et al.  An Implementation of OBJ2: An Object-Oriented Language for Abstract Program Specification , 1986, FSTTCS.

[16]  José Meseguer,et al.  Principles of OBJ2 , 1985, POPL.

[17]  Joseph A. Goguen,et al.  Some design principles and theory for OBJ-O, a language to express and execute algebraic specification for programs , 1978, Mathematical Studies of Information Processing.

[18]  Christoph M. Hoffmann,et al.  Programming with Equations , 1982, TOPL.

[19]  J. Meseguer,et al.  Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems , 1993, Inf. Comput..

[20]  Richard B. Kieburtz,et al.  The G-Machine: A Fast, Graph-Reduction Evaluator , 1985, FPCA.

[21]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .