Advertisement

Semantics for lisp without reference to an interpreter

  • W. M. Lippe
  • F. Simon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 83)

Abstract

The goal of the paper is to show that copy-rule semantics can handle higher order functionals in the sence of FUNARGs in LISP. A language LISP/N, which is derived from pure LISP, is introduced and the semantics are defined without reference to an interpreter; its definition is essentially based on a copy-rule for LISP/N.

Keywords

Procedure Call Procedure Statement Semantic Definition Execution Tree Declaration Part 
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.

References

  1. [Be]
    Berry, D.M.: Block Structure: Retention or Deletion. Proc. of the Third Annual ACM Symp. on Theory of Computing, 1971Google Scholar
  2. [Bo/We]
    Bobrow, D.G., Wegbreit, B.: A Model and Stack Implementation of Multiple Environments. CACM 4, 10, 1973Google Scholar
  3. [Fi]
    Fischer, M.J.: Lambda Calculus Schemata. SIGPLAN Notices 7 (1), 1972Google Scholar
  4. [Fr/Wi]
    Friedman, D.P., Wise, D.S.: CONS should not Evaluate its Arguments. Third ICALP, Edinburgh, 1976Google Scholar
  5. [Gor]
    Gordon, M.J.C.: Models of Pure LISP (a worked example in semantics). Dept. of Machine Intelligence, Univ. of Edinburgh, Rep. 31, 1973Google Scholar
  6. [Gr]
    Greussay, P.: Contribution à la définition interprétative et à l'implementation des λ-languages. Thèse ès Sciences, Paris VII, 1977.Google Scholar
  7. [Hes]
    Hesse, W.: Two-level Graph Grammars. Technische Universität München, TUM-INFO-7833, 1978Google Scholar
  8. [Ho]
    Hoare, C.A.R.: An axiomatic basis for computer programming. CACM 12, 1969Google Scholar
  9. [Ka/Li]
    Kaufholz, G., Lippe, W.M.: A Note on a Paper of H. Langmaack about Correct Procedure Parameter Transmission. Universität des Saarlandes, Bericht Nr. A 74/06, 1974Google Scholar
  10. [La]
    Langmaack, H.: On Correct Procedure Parameter Transmission in Higher Programming Languages. Acta Informatica 2, 1973Google Scholar
  11. [Li]
    Lippe, W.M.: Über die Entscheidbarkeit der formalen Erreichbarkeit von Prozeduren bei monadischen Programmen.Google Scholar
  12. [Li/Si]
    Lippe, W.M., Simon, F.: LISP/N — Basic Definitions and Properties. Bericht Nr. 4/79 des Instituts für Informatik und Praktische Mathematik der Universität KielGoogle Scholar
  13. [Mc]
    McCarthy, J. et al.: LISP 1.5 Programmer's Manual. MIT Press, Cambridge, Mass., 1966Google Scholar
  14. [Mc I]
    McCarthy, J.: A New EVAL Function. MIT Artificial Intelligence Memo No. 34Google Scholar
  15. [McG]
    McGowan, C.L.: The "most-recent" Error: its Causes and Correction. Proc. of an ACM Conf. on Proving Assertions about programs. SIGPLAN Notices Vol. 7. No. 1, 1972Google Scholar
  16. [Mo]
    Moses, J.: The Function of FUNCTION in LISP. SIGSAM Bull. 15, 1970Google Scholar
  17. [Per]
    Perrot, J.F.: LISP et λ-calcul. in: B. Robinet (Ed.) Lambda Calcul et Sémantique Formelle des Langages de Programmation, Paris, 1979Google Scholar
  18. [Ro]
    Robinet, B.: Petit precis de lambda-calcul. Ecole de l'IRIA: Implementation et Interprètation des LISP, Toulouse, 1978Google Scholar
  19. [Sa]
    Sandewall. E.: A Proposed Solution to the FUNARG Problem. Uppsala Univ. Dept. of Comp. Sci., Rep. 28, 1970Google Scholar
  20. [Schw]
    Schwartz, R.L.: A W-grammar Description of LISP. Modeling and Measurement Note No. 34, Comp. Dept. School of Eng. and Appl. Sci., UCLA, 1975Google Scholar
  21. [Si I]
    Simon, F.: Zur Charakterisierung von LISP als ALGOL-ähnliche Programmiersprache mit einem strikt nach dem Kellerprinzip arbeitenden Laufzeitsystem. Dissertation, Kiel, 1978Google Scholar
  22. [Si]
    Simon, F.: Cons-freies Programmieren in LISP unter deletion-Strategie. in: Informatik Fachberichte, Bd. 1, Springer Verlag, 1976Google Scholar
  23. [Si/Tr]
    Simon, F., Trademann, P.: Eine Beziehung zwischen consfreiem LISP und Stackautomaten. Journal of Information Processing and Cybernetics (EIK), Vol. 14, No. 12, 1978Google Scholar
  24. [Smi]
    Smith, D.C.: MLISP. Stanford Artificial Intelligence Project Memo AIM-135, Computer Science Department Report No. CS 179, Oktober 1970Google Scholar
  25. [Ste]
    Steele, G.J. Jr.: Macaroni is Better than Spaghetti. Proc. of the Symp. on AI and Progr. Lang., ACM, 1977Google Scholar
  26. [St/Su]
    Steele, G.J. Jr., Sussman, G.J.: The Art of the Interpreter or the Modularity Complex. AI Memo No. 453, MIT AI-Lab., 1978Google Scholar
  27. [Sto]
    Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press Series in Computer Science, Cambridge, Mass., 1977Google Scholar
  28. [Weg]
    Wegner, P.: Three Computer Cultures.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • W. M. Lippe
    • 1
  • F. Simon
    • 1
  1. 1.Institut für Informatik und Praktische MathematikUniversität KielKiel 1

Personalised recommendations