Skip to main content

An Expert System for Implementing Abstract Sorting Algorithms on Parameterized Abstract Data Types

  • Conference paper
GWAI-81

Part of the book series: Informatik-Fachberichte ((2252,volume 47))

  • 64 Accesses

Abstract

The APE (Automatic Programming Expert) system constructs executable and efficient programs from

  • algebraic specifications of abstract data types, and

  • abstract algorithms given as conditional term-rewrite-rule-systems with terms built up from operation symbols of the abstract data types involved.

The APE is an experimental system devised to develop methods for codifying a rather broad extent of programming knowledge required to construct implementations of data types and algorithms.

For data type specifications, the APE admits hidden operations, conditional axioms, and parameterized data types. The APE automatically implements algebraic specifications of all commonly known data types in terms of clusters of INTERLISP-functions. The APE constructs executable implementations of a variety of sorting and searching algorithms.

As an experimental prototype, the APE demonstrates that a knowledge-based programming paradigm provides a useful tool for partially automating an important phase of software development.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrig, H. Algebraic theory of parameterized specifications with requirements. Proc. 6th CAAP, Genova 1981, Springer-Verlag (in press).

    Google Scholar 

  2. Eigemeier, H., Ch. Knabe, P. Raulefs, K. Tramer. Automatic implementation of algebraic specifications of abstract data types. Memo SEKI-BN-79 (Nov.79), Univ. Bonn, Inst. f. Informatik III and Proc. AISB-80 Conf. on Artificial Intelligence.

    Google Scholar 

  3. Eigemeier, H., Ch. Knabe, P. Raulefs, K. Tramer. An expert system for automatic coding of abstract data type specifications. Proc. 10th Annual GI-Conf., Springer InformatikFachberichte 33,1980, pp. 431–441.

    Google Scholar 

  4. Hornung, G., P.Raulefs. Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities. Proc. 6th CAAP, Genova 1981, Springer-Verlag (in press).

    Google Scholar 

  5. Knuth, D.E. The Art of Computer Programming. Vol.3, Addison-Wesley, 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartels, U., Olthoff, W., Raulefs, P. (1981). An Expert System for Implementing Abstract Sorting Algorithms on Parameterized Abstract Data Types. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02328-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10859-7

  • Online ISBN: 978-3-662-02328-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics