Experiences with the RAP system — a specification interpreter combining term rewriting and resolution

  • Alfons Geser
  • Heinrich Hussman
Term Rewriting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 213)


This paper summarizes our experience gained using the RAP system, an interpreter for algebraic specifications which combines term rewriting and resolution techniques. A short description of the system is given and some points are worked out which may be of general interest for future development of similar systems: termination criteria, efficiency and search strategies.


Rapid Prototype Logic Programming Proof Tree Abstract Data Type Infinite Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Barr, Feigenbaum 81]
    A. Barr, E. A. Feigenbaum, The handbook of artificial intelligence, Vol. I. Heuris Tech Press, Stanford 1981Google Scholar
  2. [Bidoit, Choppy 85]
    M. Bidoit, C. Choppy, ASSPEGIQUE: An integrated environment for algebraic specifications, Proc. TAPSOFT 85, LNCS 186, pp.246–260Google Scholar
  3. [Bouge et al. 85]
    L. Bouge, N. Choquet, L. Fribourg, M. C. Gaudel, Application of PROLOG to test sets generation from algebraic specifications. Proc. TAPSOFT 85 Conf., LNCS 186, pp.262–275Google Scholar
  4. [Broy, Pair, Wirsing 81]
    M. Broy, C. Pair, M. Wirsing, A systematic study of models of abstract data types. Report 81-R-04Z, Université de Nancy, Nancy 1981. To appear also in TCS.Google Scholar
  5. [Budde et al. 84]
    R. Budde,K. Kuhlenkamp, L. Mathiassen, H. Züllinghoven (Eds.): Approaches to prototyping. Berlin/Heidelberg/New York/Tokyo 1984.Google Scholar
  6. [CIP 85]
    A. Horsch, B. Möller, H. Partsch, O. Paukner, P. Pepper, The Munich project CIP, Vol. II, Part I: Formal specification. Report TUM-I8509 Technische Universität München, München 1985Google Scholar
  7. [Dick 85]
    A. J. J. Dick, ERIL — Equational reasoning: an interactive laboratory. Internal report Rutherford Appleton Laboratory, Chilton, Didcot 1985Google Scholar
  8. [Fribourg 84a]
    L. Fribourg, Oriented equational clauses as a programming language. Report 84002 Laboratoires de Marcoussis, Marcoussis 1984. Short version in: Proc. 11th ICALP Conf., LNCS 172, pp. 162–173Google Scholar
  9. [Fribourg 84b]
    L. Fribourg, Handling function definitions through innermost superposition and rewriting. Report 84-69 LITP, Université Paris 7, 1984. Short version in: Proc. 1st RTA Conf., to appear in LNCSGoogle Scholar
  10. [Geser 86]
    A. Geser, An algebraic specification of the INTEL 8085 microprocessor: A case study. Report Universität Passau, to appear.Google Scholar
  11. [Geser, Hussmann 85]
    A. Geser, H. Hussmann, Rapid prototyping for algebraic specifications — examples for the use of the RAP system, Report MIP-8517 Universität Passau, Passau 1985.Google Scholar
  12. [Goguen, Meseguer 84]
    J. A. Goguen, J. Meseguer, Equality, types, modules and generics for logic programming. Report CSLI-84-5 Leland Stanford Junior University, Stanford 1985Google Scholar
  13. [Huet, Oppen 80]
    G. Huet, D. C. Oppen, Equations and rewrite rules — a survey. In: R. V. Book (ed.), Formal language theory — perspectives and open problems. Academic PressGoogle Scholar
  14. [Hullot 80]
    J. M. Hullot, Canonical forms and unification. Proc. 5th CADE Conf., LNCS 87, pp. 318–334 1980Google Scholar
  15. [Hussmann 85a]
    H. Hussmann, Unification in conditional-equational theories, Report MIP-8502 Universität Passau, Passau 1985. Short version also in: Proc. EUROCAL 85, to appear in LNCS.Google Scholar
  16. [Hussmann 85b]
    H. Hussmann, Rapid prototyping for algebraic specifications — RAP system user's manual. Report MIP-8504 Universität Passau, Passau 1985Google Scholar
  17. [Kaplan 83]
    S. Kaplan, Fair conditional term rewriting systems: unification, termination and confluence. Report 194 LRI Université de Paris-Sud, Orsay 1984Google Scholar
  18. [Lescanne 83]
    P. Lescanne, Computer experiments with the REVE term rewriting system generator, Proc. 10th ACM Conf. on Principles of Programming Languages, Austin, Texas 1983Google Scholar
  19. [Remy, Zhang 84]
    J. L. Remy, H. Zhang, REVEUR4: A system for validating conditional algebraic specifications of abstract data types. In: T. O'Shea (ed.), Proc. ECAI 84: Advances in artificial intelligence, pp. 563–572, North-Holland 1984Google Scholar
  20. [Rety et al. 85]
    P. Rety, C. Kirchner, H. Kirchner, P. Lescanne, NARROWER: a new algorithm for unification and its application to logic programming. In: Proc. RTA 85 Conf., to appear in LNCS.Google Scholar
  21. [Wirsing et al. 83]
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20(1983), 1–33.Google Scholar
  22. [Wos et al. 84]
    L. Wos, R. Overbeek, E. Lusk, J. Boyle: Automated Reasoning, introduction and applications, Prentice Hall Inc., 1984Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Alfons Geser
    • 1
  • Heinrich Hussman
    • 1
  1. 1.Universität PassauPassau

Personalised recommendations