Programming in OBJ and Maude

This is a introduction to the gentle art of programming in OBJ and Maude. The features of OBJ that are highlighted are its logic— ordersorted equational logic— connections of this logic with unsorted first-order equational logic, newer features of the language, and parameterized programming. The language Maude— which contains OBJ as its functional sublanguage and extends OBJ to include object-oriented programming and concurrent systems programming— is briefly introduced with a focus on its logic and some simple examples.

[1]  José Meseguer,et al.  Architectural Design of the Rewrite Rule Machine Ensemble , 1991 .

[2]  Joseph A. Goguen,et al.  THE REWRITE RULE MACHINE, 1988 , 1989 .

[3]  J. A. Goguen,et al.  Completeness of many-sorted equational logic , 1981, SIGP.

[4]  Alain J. Martin.  The limitations to delay-insensitivity in asynchronous circuits , 1990 .

[5]  William W. Wadge,et al.  Lucid, the dataflow programming language , 1985 .

[6]  Vincenzo Manca,et al.  Equational Type Logic , 1990, Theor. Comput. Sci..

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

[8]  José Meseguer,et al.  Software for the Rewrite Rule Machine , 1988, Fifth Generation Computer Systems.

[9]  R. Smullyan.  First-Order Logic , 1968 .

[10]  J. Goguen.  Higher-order functions considered unnecessary for higher-order programming , 1990 .

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

[12]  Joseph A. Goguen,et al.  Cell and Ensemble Architecture for the Rewrite Rule Machine , 1988, FGCS.

[13]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[14]  J. D. Monk,et al.  Mathematical Logic , 1976 .

[15]  José Meseguer,et al.  Parallel Programmming in Maude , 1991, Research Directions in High-Level Parallel Programming Languages.

[16]  K. Mani Chandy.  Parallel program design , 1989 .

[17]  Joseph A. Goguen,et al.  OBJ as a Theorem Prover with Applications to Hardware Verification , 1989 .

[18]  José Meseguer,et al.  Equality, Types, Modules and Generics for Logic Programming , 1984, ICLP.

[19]  Jieh Hsiang,et al.  Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[20]  Joseph A. Goguen,et al.  Proving and Rewriting , 1990, ALP.

[21]  Raymond M. Smullyan.  First-Order Logic. Preliminaries , 1968 .

[22]  José Meseguer,et al.  Compiling Concurrent Rewriting onto the Rewrite Rule Machine , 1990, CTRS.

[23]  J. Goguen,et al.  2OBJ: a metalogical framework theroem prover based on equational logic , 1992, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[24]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[25]  Leon Henkin,et al.  The Logic of Equality , 1977 .

[26]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[27]  Leon Henkin,et al.  On Mathematical Induction , 1960 .

[28]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[29]  Werner Nutt,et al.  Basic Narrowing Revisited , 1989, J. Symb. Comput..

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

[31]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[32]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[33]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.

[34]  Joseph A. Goguen,et al.  Principles of parameterized programming , 1989 .

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

[36]  Axel Poigné.  Once More on Order-Sorted Algebras , 1991, MFCS.