Skip to main content
SpringerLink
Log in

Programming, transforming, and proving with function abstractions and memories

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 372))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  • Felleisen, M. [1987] The calculi of lambda-v-cs conversion: A syntactic theory of control and state in imperative higher-order programming languages, Ph.D. thesis, Indiana University.

    Google Scholar 

  • Landin, P. J. [1964] The mechanical evaluation of expressions, Computer Journal, 6, pp. 308–320.

    Google Scholar 

  • Mason, I. A. [1986] The semantics of destructive Lisp, Ph.D. Thesis, Stanford University.

    Google Scholar 

  • Mason, I. A. and Talcott, C. L. [1989a] Equivalence of programs with function abstractions and memories, Submitted to Lisp and Symbolic Computation.

    Google Scholar 

  • Mason, I. A. and Talcott, C. L. [1989b] Axiomatizing Operational Equivalence in the presence of Side Effects, in: Symposium on logic in computer science, (IEEE), (to appear).

    Google Scholar 

  • Mason, I. A. and Talcott, C. L. [1989c] A sound and complete axiomatization of operational equivalence between programs with memory, Department of Computer Science, Stanford University, Technical report STAN-CS-89-1250.

    Google Scholar 

  • Mason, I. A. and Talcott, C. L. [1989d] Programming, transforming and proving with function abstractions and memories, Department of Computer Science, Stanford University, Technical report STAN-CS-89-????.

    Google Scholar 

  • Morris, J. H. [1968] Lambda calculus models of programming languages, Ph.D. thesis, MIT.

    Google Scholar 

  • Mosses, P. [1984] A basic abstract semantic algebra, in: Semantics of data types, international symposium, Sophia-Antipolis, June 1984, proceedings, edited by G. Kahn, D.B. MacQueen, and G. Plotkin, Lecture notes in computer science, no. 173 (Springer, Berlin) pp. 87–108.

    Google Scholar 

  • Plotkin, G. [1975] Call-by-name, call-by-value and the lambda-v-calculus, Theoretical Computer Science, 1, pp. 125–159.

    Article  Google Scholar 

  • Reynolds, J. C. [1972] Definitional interpreters for higher-order programming languages, in: Proceedings, ACM national convention, pp. 717–740.

    Google Scholar 

  • Talcott, C. [1985] The essence of Rum: A theory of the intensional and extensional aspects of Lisp-type computation, Ph.D. Thesis, Stanford University.

    Google Scholar 

  • Talcott, C. [1987] Programming and proving with function and control abstractions, (Course notes)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, USA

    Ian Mason & Carolyn Talcott

Authors
  1. Ian Mason
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolyn Talcott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mason, I., Talcott, C. (1989). Programming, transforming, and proving with function abstractions and memories. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035784

Download citation

  • DOI: https://doi.org/10.1007/BFb0035784

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation