Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

A Filter Lambda Model and the Completeness of Type Assignment

Henk Barendregt, Mario Coppo and Mariangiola Dezani-Ciancaglini
The Journal of Symbolic Logic
Vol. 48, No. 4 (Dec., 1983), pp. 931-940
DOI: 10.2307/2273659
Stable URL: http://www.jstor.org/stable/2273659
Page Count: 10
  • Read Online (Free)
  • Download ($10.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A Filter Lambda Model and the Completeness of Type Assignment
Preview not available

Page Thumbnails

  • Thumbnail: Page 
931
    931
  • Thumbnail: Page 
932
    932
  • Thumbnail: Page 
933
    933
  • Thumbnail: Page 
934
    934
  • Thumbnail: Page 
935
    935
  • Thumbnail: Page 
936
    936
  • Thumbnail: Page 
937
    937
  • Thumbnail: Page 
938
    938
  • Thumbnail: Page 
939
    939
  • Thumbnail: Page 
940
    940