Skip to main content
SpringerLink
Log in

Reasoning about programs with effects

  • Static Analysis
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1990)

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

  • 162 Accesses

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.

7. References

  • Felleisen, M. and Hiebe, R. [1989] The Revised Report on the Syntactic Theories of Sequential Control and State, Department of Computer Science, Rice University Technical Report Rice COMP TR89-100.

    Google Scholar 

  • Gabriel, R. P. [1985] Performance and Evaluation of Lisp Systems, (MIT Press).

    Google Scholar 

  • Guzmán, J. C. and Hudak. P [1990] Single-Threaded Polymorphic Lambda Calculus. Fifth annual symposium on logic in computer science, (IEEE).

    Google Scholar 

  • Lucasen, J. M. and Gifford, D. K. [1988] Polymorphic effect systems, in: 16th annual ACM symposium on principles of programming languages, pp. 47–57.

    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] A Sound and Complete Axiomatization of Operational Equivalence between Programs with Memory, Stanford University Computer Science Department Report STAN-CS-89-1250. (Revised and extended version to appear in Theoretical Computer Science).

    Google Scholar 

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

    Google Scholar 

  • Mason, I. A. and Talcott, C. L. [1989c] Programming, Transforming, and Proving with function abstractions and memories. in: Proceedings of the 16th EATCS Colloquium on Automata, Languages and Programming, Stresa Italy, Lecture notes in computer science, 372, (Springer-Verlag). (Revised and extended version submitted for publication).

    Google Scholar 

  • Moggi, E. [1989] Computational lambda-calculus and monads, Fourth annual symposium on logic in computer science, (IEEE).

    Google Scholar 

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

    Google Scholar 

  • Reynolds, J. C. [1989] Syntactic Control of Interference, II in: Proceedings of the 16th EATCS Colloquium on Automata, Languages and Programming, Stresa Italy, Lecture notes in computer science, 372, (Springer-Verlag)

    Google Scholar 

  • Talcott, C. [1989] Programming and proving with function and control abstractions, Stanford University Computer Science Department Technical report STAN-CS-89-1288.

    Google Scholar 

  • Wadler, P. [1990] Linear types can change the world! IFIP working conference on programming concepts and methods. Sea of Gallilee, Israel.

    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

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mason, I., Talcott, C. (1990). Reasoning about programs with effects. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024185

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation