Towards advanced programming environments based on algebraic concepts

  • Manfred Broy
  • Alfons Geser
  • Heinrich Hussmann
Program Reuse And Transformations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 244)


As the formal basis for a methodology of software development an algebraic approach is proposed that can be supported by powerful programming environments. Algebraic specifications are formulated with equations, based on first order partial logic. The paper contains a short description of the Passau RAP system for prototyping algebraically specified abstract data types. It outlines the position of the RAP system within a future software environment and explains the environment concept that is currently studied within the ESPRIT project 432 METEOR at the University of Passau.


Rapid Prototype Logic Programming Algebraic Approach Horn Clause Equational Logic 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bouge et al. 85]
    L. Bouge, N. Choquet, L. Fribourg, M. C. Gaudel: Test set generation from algebraic specifications using logic programming. Report No. 240, LRI, Orsay 1985. Preliminary version in: Proc. TAPSOFT 85 Conf., LNCS 186, pp. 262–265, 1985.Google Scholar
  2. [Broy, Pepper 83]
    M. Broy, P. Pepper: Program development as a formal activity. IEEE SE-7:1, 1981, pp. 14–22.Google Scholar
  3. [Broy et al. 86]
    M. Broy, B. Möller, P. Pepper, M. Wirsing: Algebraic implementation preserves program correctness. Science of Computer Programming 8, 1986.Google Scholar
  4. [Futatsugi et al. 85]
    K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, J. Meseguer: Principles of OBJ2. Proc. 12th POPL Conf., 1985.Google Scholar
  5. [Geser 86]
    A. Geser: An algebraic specification of the intel 8085 microprocessor — A case study. Report MIP-8608, Universität Passau, May 1986.Google Scholar
  6. [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, Dec. 1985.Google Scholar
  7. [Geser, Hussmann 86]
    A. Geser, H. Hussmann: Experiences with the RAP system — a specification interpreter combining term rewriting and resolution techniques. Proc. ESOP 86 Conf., LNCS 213, pp. 339–350, 1986.Google Scholar
  8. [CIP 85]
    The CIP Language Group: The Munich project CIP, Vol. I: The wide spectrum language CIP-L. LNCS 183, 1985.Google Scholar
  9. [Ehrig et al. 82]
    H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz: Algebraic implementation of abstract data types. Theoretical Computer Science TCS 20, pp. 209–263, 1982.Google Scholar
  10. [Hussmann 85]
    H. Hussmann: Unification in conditional-equational theories. Proc. EUROCAL 85 Conf., LNCS 204, pp. 543–553, 1985.Google Scholar
  11. [Kirchner 84]
    H. Kirchner: A general inductive completion algorithm and application to abstract data types. Proc. 7th CADE, LNCS 170, pp. 282–302, 1984.Google Scholar
  12. [Wirsing et al. 83]
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20, pp. 1–33, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Manfred Broy
    • 1
  • Alfons Geser
    • 1
  • Heinrich Hussmann
    • 1
  1. 1.Fakultät für InformatikUniversität PassauPassauF. R. of Germany

Personalised recommendations