ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Corrigendum: decidable bounded quantification
Full text PdfPdf (108 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
San Francisco, California, United States
Page: 408  
Year of Publication: 1995
ISBN:0-89791-692-1
Authors
Giuseppe Castagna  LIENS (CNRS) 45, rue d'Ulm Paris, France
Benjamin C. Pierce  LFCS, Univ. of Edinburgh, Edinburgh, U.K.
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/199448.199539
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

CP94
Giuseppe Castagna , Benjamin C. Pierce, Decidable bounded quantification, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.151-162, January 16-19, 1994, Portland, Oregon, United States  [doi>10.1145/174675.177844]
 
G94
Giorgio Ghelli. Fsubtop does not enjoy the minimum type property. Message to Types list, 28 Jan. 1994.
 
G94
Benjamin C. Pierce. Re" Fsubtop and minimal typing. Message to Types list, 28 Jan. 1994.

CITED BY  3
Giorgio Ghelli, Complexity of kernel Fun subtype checking, ACM SIGPLAN Notices, v.31 n.6, p.134-145, June 15, 1996
Adriana Compagnoni, Higher-order subtyping and its decidability, Information and Computation, v.191 n.1, p.41-103, May 25, 2004
François Bourdoncle , Stephan Merz, Type checking higher-order polymorphic multi-methods, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.302-315, January 15-17, 1997, Paris, France

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.3 Studies of Program Constructs
          Subjects: Type structure

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Lambda calculus and related systems


General Terms:
Algorithms, Languages

Collaborative Colleagues:
Giuseppe Castagna: colleagues
Benjamin C. Pierce: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player