skip to main content
10.1145/319838.319876acmconferencesArticle/Chapter ViewAbstractPublication PageslfpConference Proceedingsconference-collections
Article
Free Access

A semantic model of reference counting and its abstraction (detailed summary)

Authors Info & Claims
Published:08 August 1986Publication History
First page image

References

  1. 1.D.W. Clark. An empirical study of list structure in lisp. CACM, 20(2):78-87, February 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th A CM Sym. on Prin. of Prog. Lang., pages 238- 252, ACM, 1077. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.C.A.R. Hoare. quicksort. Computing J., 5(4):10-15, April 1962.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4.P. Hudak. Collecting interpretations of first-order lambda calculus. Research Report in preparation, Yale University, Department of Computer Science, 1986.Google ScholarGoogle Scholar
  5. 5.P. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In l~th A CM Sym. on Prin. of Pro~. Lang., pages 300-314, ACM, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In 9th ACbt $ym. on Prin. of Pro~. Lang., pages 66-74, ACM, January 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.A. Mycroft. Abstract Interpretation and Optimizing Transformations for Appli~otive Programs. PhD thesis, Univ. of Edinburgh, 1981.Google ScholarGoogle Scholar
  8. 8.J. Schwarz. Verifying the safe use of destructive operations in applicative programs, in B. Robinet, editor, Program Transformations - Proc. of the $rd Int'l $ym. on Programming, pages 395-411, Dunod Informatique, 1978.Google ScholarGoogle Scholar
  1. A semantic model of reference counting and its abstraction (detailed summary)

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming
      August 1986
      372 pages
      ISBN:0897912004
      DOI:10.1145/319838

      Copyright © 1986 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 August 1986

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate30of109submissions,28%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader