System support for modular order-sorted Horn clause specifications

The authors present an overview of CEC, a rewrite rule laboratory for order-sorted specifications with conditional equations. CEC differs from related systems, such as OBJ-3, in that it can check or achieve by completion the semantic prerequisites for correct operational execution of specifications by conditional term rewriting. CEC supports the modular structure of specifications in two ways. Its speculation browser allows accessing, editing, and administrating the modules of a specification through a highly interactive user interface. The completion procedure, apart from transforming a specification into executable rewrite code, will find the inconsistencies, if any, between the formal and actual parameters of generic specifications. CEC can handle a large class of conditional equations with extra variables in the condition without having to resort to inefficient goal solving methods at rewrite time.<<ETX>>

[1]  Claude Kirchner,et al.  Equational Completion in Order-Sorted Algebras , 1990, Theor. Comput. Sci..

[2]  Laurent Fribourg,et al.  SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting , 1985, SLP.

[3]  Axel Poigné.  Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications , 1987, ADT.

[4]  Friedrich L. Bauer,et al.  The Munich Project CIP , 1988, Lecture Notes in Computer Science.

[5]  Stéphane Kaplan,et al.  On the decidability of quasi-reducibility , 1986, Bull. EATCS.

[6]  Harald Ganzinger.  A Completion Procedure for Conditional Equations , 1987, CTRS.

[7]  Giorgio Levi,et al.  Foundations of Logic and Functional Programming , 1988, Lecture Notes in Computer Science.

[8]  Stéphane Kaplan,et al.  Completion Algorithms for Conditional Rewriting Systems , 1989 .

[9]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[10]  Claude Kirchner,et al.  Equational Completion in Order-Sorted Algebras (Extended Abstract) , 1988, CAAP.

[11]  Martin Gogolla,et al.  Über partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen , 1986 .

[12]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

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

[14]  Friedrich L. Bauer,et al.  The Munich Project CIP: Volume I: The Wide Spectrum Language CIP-L , 1985 .

[15]  Arnold Oberschelp.  Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .

[16]  Leo Bachmair.  Proof methods for equational theories , 1987 .

[17]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[18]  Michaël Rusinowitch,et al.  On Word Problems in Horn Theories , 1988, J. Symb. Comput..

[19]  Friedrich Ludwig Bauer,et al.  The wide spectrum language CIP-L , 1985 .

[20]  Corrado Moiso,et al.  A Completeness Result for E-unification Algorithms Based on Conditional Narrowing , 1986, Foundations of Logic and Functional Programming.

[21]  Corrado Moiso,et al.  Refined Strategies for Semantic Unification , 1987, TAPSOFT, Vol.2.

[22]  Bernd Krieg-Brückner,et al.  Algebraic Specification with Functionals in Program Development by Transformation , 1989 .

[23]  Harald Ganzinger,et al.  Completion-Time Optimization of Rewrite-Time Goal Solving , 1989, RTA.

[24]  Bernd Krieg-Brückner,et al.  Integration of Program Construction and Verification: The PROSPECTRA Methodology , 1986, System Development and Ada.

[25]  Harald Ganzinger.  Ground Term Confluence in Parametric Conditional Equational Specifications , 1987, STACS.

[26]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[27]  Hantao Zhang,et al.  Contextual Rewriting , 1985, RTA.

[28]  Donald Sannella,et al.  Extended ML: An Institution-Independent Framework for Formal Program Development , 1985, ADT.

[29]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

[30]  Harald Ganzinger.  Completion with History-Dependent Complexities for Generated Equations , 1987, ADT.

[31]  Nachum Dershowitz,et al.  Logic Programming cum Applicative Programming , 1985, SLP.

[32]  Adele Goldberg,et al.  Smalltalk-80 - the interactive programming environment , 1984 .

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

[34]  Jean-Pierre Bourguignon,et al.  Mathematische Annalen , 1893 .

[35]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules , 1988, FGCS.

[36]  Hubert Comon,et al.  Inductive Proofs by Specification Transformation , 1989 .

[37]  Leo Bachmair,et al.  Proof by consistency in equational theories , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[38]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[39]  Harald Ganzinger,et al.  Order-Sorted Completion: The Many-Sorted Way (Extended Abstract) , 1989, TAPSOFT, Vol.1.

[40]  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.