Skip to main content

Understanding Lisp Programs is Improving Lisp Programs

  • Conference paper
GI — 6. Jahrestagung

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

  • 38 Accesses

Abstract

In this paper we describe the knowledge and reasoning processes of a special LISP system. In this system completely automatic improvements of both syntactic and semantic features of LISP programs are performed. It is defined as an ordinary LISP system with the following restrictions:

  • exclusion of functional arguments

  • partitioning of variable-, function- and label-names.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  • BOYER R.S. & MOORE J.S., (1973), Proving Theorems about LISP Functions, Proc. 3rd IJCAI, Standford University, Stanford Ca., pp. 486–493.

    Google Scholar 

  • CHAILLOUX J., (1976), VLISP-10 Manuel de références, Departement d’Informatique, Université de Paris 8, Février 1976, RT-17–76.

    Google Scholar 

  • DARLINGTON J. & BURSTALL R.M., (1973), A system which automatically improves programs, Proc. 3rd IJCAI, Stanford University, Stanford Ca., pp. 479–485.

    Google Scholar 

  • FLAVIGNY B.,(1975), Un programme détecteur d’erreurs de logique dans les programmes, Revue Française d’Automatique, Informatique et Recherche Operationnelle, n° juil. 1975 B-2, pp. 43–59.

    Google Scholar 

  • FLOYD R.W., (1967), Assigning meanings to programs, Proc. Amer. Math. Soc. Symposium in Applied Mathematics, vol. 19, Providence, Rhodes Island, pp. 19–32.

    Google Scholar 

  • GREEN, WALDINGER, BARSTOW, ELSCHLAGER, LENAT, MCCUNE, SHAW & STEINBERG, (1974), Progress Report on Program-Understanding Systems, AIM-MEMO 240, Stanford University, Stanford Ca.

    Google Scholar 

  • GREEN C. & BARSTOW D., (1975), A Hypothetical dialogue Exhibiting a Knowledge Base for a Program-Understanding System, AIM-MEMO 258, Stanford University, Stanford

    Google Scholar 

  • GREUSSAY P., (1976), Descriptions compactes d’interprètes implémentables, 2ème Colloque International sur la Programmation, B. ROBINET, avril 1976, Paris, pp. 281–297 (to appear at Springer-Verlag).

    Google Scholar 

  • HEWITT C., (1971), Procedural Embedding of Knowledge in PLANNER, Proc. 2nd IJCAI, London, pp. 167–182.

    Google Scholar 

  • HEWITT C., BISHOP P., GREIF I., SMITH B., MATSON T. & STEIGER R., (1973), Actor Induction & Meta Evaluation, ACM Symposium of Programming Languages, Boston, pp. 153 – 167.

    Google Scholar 

  • HEWITT C., (1975), Stereotypes as an Actor Approach towards Solving the Problem of Procedural Attachment in FRAME Theories, in Theoretical Issues in Natural Language Processing, an interdisciplinary Workshop, Cambridge, Mass., pp. 108–117.

    Google Scholar 

  • HEWITT C., (1975a), How to use what you know, proc. 4th IJCAI, Tbilisi, Georgia, USSR, pp. 189–198.

    Google Scholar 

  • LENAT D.C., (1975), Synthesis of large Programs from specific Dialogues, Actes du Colloque IRIA: “Construction, Amélioration et Vérification de Programmes”, G. Huet, G. Kahn, Arc & Senan, pp. 225–241.

    Google Scholar 

  • LUCKHAM D.C. & SUZUKI N., (1975), Automatic Program Verification IV: Proof of Termination within a weak Logic of Programs, AIM-MEMO 269, Stanford University, Stanford Ca.

    Google Scholar 

  • MANNA Z. (1974), Introduction to Mathematical Theory of Computation, McGraw Hill,N.Y.

    Google Scholar 

  • MANNA Z. & WALDINGER R., (1975), Knowledge and Reasoning in Program Synthesis, Artificial Intelligence, vol. 6, n°2, North-Holland, Amsterdam, pp. 175–208.

    Google Scholar 

  • PLATON, Théètète, H. Stéphanus, Paris, 1578, pp. 148E à 150D.

    Google Scholar 

  • RUTH G.R., (1973), Analysis of Algorithm Implementations, Ph.D Thesis, Project Mac, M.I.T., Cambridge, Mass.

    Google Scholar 

  • SANDEWALL E., (1975), Ideas about Management of LISP Data Bases, Memo n° 332, A.I. lab., M.I.T., Cambridge, Mass.

    Google Scholar 

  • SIKLOSSY L., (1973), The Case for, and some Experience with, automated Consultants, Proc. 2nd Texas Conf. on Computing Systems, Austin, Texas, pp. 23–1 à 23–4.

    Google Scholar 

  • SUSSMAN G.J., (1972), Teaching of Procedures — Progress Report, Memo n° 270, A.I. Lab., M. I.T., Cambridge, Mass.

    Google Scholar 

  • SUSSMAN G.J., (1973), A Computational Model of Skill Acquisition, Ph.D. Thesis, AI-TR-297, A.I. Lab., M.I.T., Cambridge, Mass.

    Google Scholar 

  • TEITELMAN W., (1974), INTERLISP Reference Manual, Xerox, Palo Alto, Ca.

    Google Scholar 

  • WALDINGER R. & LEVITT K.N., (1974), Reasoning about Programs, Artificial Intelligence vol. 5, n°3, North-Holland, Amsterdam, pp. 235–316.

    Google Scholar 

  • WERTZ H., (1976), Sur la compréhension des programmes LISP améliorables, Département d’Informatique, Universite de Paris 8, RT 18–76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Wertz, H. (1976). Understanding Lisp Programs is Improving Lisp Programs. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics