Article

Free access

A theory of type qualifiers

Authors:

Jeffrey S. Foster,

Manuel Fähndrich,

Alexander AikenAuthors Info & Claims

PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation

Pages 192 - 203

https://doi.org/10.1145/301618.301665

Published: 01 May 1999 Publication History

Abstract

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a set of real C programs, many more consts can be used than are actually present in the original code.

References

[1]

Martin Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. A Core Calculus of Dependency. In Proceedings of the ~6th Annual A CM SIGPLAN. SIGACT Symposium on Principles of Programming Languages, pages 147-160, San Antonio, Texas, January 1999.

Digital Library

[2]

Martin Abadi and Luca Cardelli. A Theory of Objects. Springer, 1996.

Digital Library

[3]

Alexander Aiken, Manuel Fahndrich, Jeffrey S. Foster, and Zhendong Su. A Toolkit for Constructing Type- and Constraint-Based Program Analyses. In Proceedings of the second International Workshop on Types in Compilation, Kyoto, Japan, March 1998.

Digital Library

[4]

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1988.

Digital Library

[5]

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. Mc- Graw Hill, 1990.

Digital Library

[6]

David L. Detlefs. An overview of the Extended Static Checking system. In Proceedings of the First Workshop on Formal Methods in Software Practice, pages 1-9, January 1996.

[7]

Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In Static Analysis, Second International Symposium, number 983 in Lecture Notes in Computer Science, pages 118-135, Glasgow, Scotland, September 1995. Springer-Verlag.

[8]

Jonathan Eifrig, Scott Smith, and Valery Trifonov. Type Inference for Recursively Constrained Types and its Application to OOP. In Mathematical Foundations of Programming Semantics, Eleventh Annual Conference, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995.

[9]

David Evans. Static Detection of Dynamic Memory Errors. in Proceedings of the 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 44-53, Philadelphia, Pennsylvania, May 1996.

Digital Library

[10]

Fritz Henglein. Efficient Type Inference for Higher- Order Binding-Time Analysis. In J. Hughes, editor, FPCA '91 Conference on Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 448-472, Cambridge, MA, August 1991. Springer-Verlag.

Digital Library

[11]

Fritz Henglein and jakob Rehof. The Complexity of Subtype Entailment for Simple Types. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 352-361, Warsaw, Poland, July 1997.

Digital Library

[12]

Proceedings of the third A CM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998.

[13]

Mark P. Jones. A theory of qualified types. In Bernd Krieg-Brficker, editor, 4th European Symposium on Programming, number 582 in Lecture Notes in Computer Science, pages 287-306, Rennes, France, February 1992. Springer-Verlag.

[14]

Richard Kieburtz. Taming Effects with Monadic Typing. In ICFP'98 {ICF98}, pages 51-62.

Digital Library

[15]

Brian W. Kernighan and Dennis M. Ritchie. The C Programming Language. Prentice Hall, 2nd edition, 1988.

Digital Library

[16]

Ntis Klarlund and Michael I. Schwartzback. Graph Types. In Proceedings of the 20th Annual A CM SiGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 196-205, Charleston, South Carolina, January 1993.

Digital Library

[17]

John M. Lucassen and David K. Gifford. Polymorphic Effect Systems. In Proceedings of the 15th Annual A CM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 47-57, San Diego, California, January 1988.

Digital Library

[18]

K. Rustan M. Leino and Greg Nelson. An Extended Static Checker for Modula-3. In Compiler Construction: 7th International Conference, volume 1383 of Lecture Notes in Computer Science, pages 302-305, April 1998.

Digital Library

[19]

Steve Maguire. Writing Solid Code. Microsoft Press, 1993.

Digital Library

[20]

Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.

[21]

John C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(3):245- 285, July 1991.

[22]

David R. Musser, Atul Saint, and Alexander Stepanov. STL Tutorial and Reference Guide. Addison-Wesley Publishing Company, 1996.

[23]

Peter Orba~k and Jens Palsberg. Trust in the )~-calculus. Journal of Functional Programming, 3(2):75-85, 1997.

Digital Library

[24]

Martin Odersky, Martin Sulzmann, and Martin Wehr. Type Inference with Constrained Types. In Benjamin Pierce, editor, Proceedings of the 4th International Workshop on Foundations of Object-Oriented Languages, January 1997.

[25]

Pure Atria. Purify: Fast detection of memory leaks and access errors.

[26]

Jakob Rehof. Personal communication, January 1999.

[27]

Kirsten Lackner Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, Computer Science Department, November 1995.

[28]

Mads Tofte and Jean-Pierre Talpin. Implementstion of the Typed Call-by-Value,Calculus using a Stack of Regions. In Proceedings of the 21st Annual A CM SIGPLAN-SIGA CT Symposium on Principles of Programming Languages, pages 188-201, Portland, Oregon, January 1994.

Digital Library

[29]

Dennis Volpano and Geoffrey Smith. A Type-Based Approach to Program Security. In Michel Bidoit and Max Danchet, editors, Theory and Practice of Software Development, 7th International Joint Conference, volume 1214 of Lecture Notes in Computer Science, pages 607-621, Lille, France, April 1997. Springer-Verlag.

[30]

Philip Wadler. The Marriage of Effects and Monads. In ICFP'98 {ICF98}, pages 63-74.

Digital Library

[31]

Andrew K. Wright and Matthias Felleisen. A Syntactic Approach to Type Soundness. Information and Computation, 115(1):38-94, 1994.

Digital Library

[32]

Andrew K. Wright. Simple Imperative Polymorphism. In Lisp and Symbolic Computation 8, volume 4, pages 343-356, 1995.

[33]

K. Yelick, L. Semenzato, G. Pike, C. Miyamoto, B. Liblit, A. Krishnamurthy, P. Hilfinger, S. Graham, D. Gay, P. Colella, and A. Aiken. Titanium: A High- Performance Java Dialect. In ACM 1998 Workshop on Java for High-Performance Network Computing, February 1998.

Cited By

Lorenzen AWhite LDolan SEisenberg RLindley S(2024)Oxidizing OCaml with Modal Memory ManagementProceedings of the ACM on Programming Languages10.1145/36746428:ICFP(485-514)Online publication date: 15-Aug-2024
https://doi.org/10.1145/3674642
Lee EZhao YLhoták OYou JSatheeskumar KBrachthäuser J(2024)Qualifying System F<:: Some Terms and Conditions May ApplyProceedings of the ACM on Programming Languages10.1145/36498328:OOPSLA1(583-612)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649832
Shadab NGharat PTiwari SErnst MKellogg MLahiri SLal ASridharan M(2023)Inference of Resource Management SpecificationsProceedings of the ACM on Programming Languages10.1145/36228587:OOPSLA2(1705-1728)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622858
Show More Cited By

Index Terms

A theory of type qualifiers
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Frameworks
2. Theory of computation

Recommendations

Flow-sensitive type qualifiers
PLDI '02: Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation

We present a system for extending standard type systems with flow-sensitive type qualifiers. Users annotate their programs with type qualifiers, and inference checks that the annotations are correct. In our system only the type qualifiers are modeled ...
A theory of type qualifiers

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or ...
Semantic type qualifiers
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

We present a new approach for supporting user-defined type refinements, which augment existing types to specify and check additional invariants of interest to programmers. We provide an expressive language in which users define new refinements and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation

May 1999

304 pages

ISBN:1581130945

DOI:10.1145/301618

Chairmen:
Barbara G. Ryder
Rutgers Univ., New Brunswick, NJ
,
Benjamin G. Zorn
Univ. of Colorado, Boulder, and Microsoft Research

ACM SIGPLAN Notices Volume 34, Issue 5
May 1999
304 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/301631
Editors:
Barbara G. Ryder
Rutgers Univ., New Brunswick, NJ
,
Benjamin G. Zorn
Univ. of Colorado, Boulder
,
A. Michael Berman
Rowan Univ., Glassboro, NJ
Issue’s Table of Contents

Copyright © 1999 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI99

Sponsor:

PLDI99: Conference on Programming Language Design and Implementation 1999

May 1 - 4, 1999

Georgia, Atlanta, USA

Acceptance Rates

PLDI '99 Paper Acceptance Rate 26 of 130 submissions, 20%;

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

185
Total Citations
View Citations
1,922
Total Downloads

Downloads (Last 12 months)353
Downloads (Last 6 weeks)45

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lorenzen AWhite LDolan SEisenberg RLindley S(2024)Oxidizing OCaml with Modal Memory ManagementProceedings of the ACM on Programming Languages10.1145/36746428:ICFP(485-514)Online publication date: 15-Aug-2024
https://doi.org/10.1145/3674642
Lee EZhao YLhoták OYou JSatheeskumar KBrachthäuser J(2024)Qualifying System F<:: Some Terms and Conditions May ApplyProceedings of the ACM on Programming Languages10.1145/36498328:OOPSLA1(583-612)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649832
Shadab NGharat PTiwari SErnst MKellogg MLahiri SLal ASridharan M(2023)Inference of Resource Management SpecificationsProceedings of the ACM on Programming Languages10.1145/36228587:OOPSLA2(1705-1728)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622858
Lee ELhoták O(2023)Simple Reference Immutability for System F<:Proceedings of the ACM on Programming Languages10.1145/36228287:OOPSLA2(857-881)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622828
Paulino HAlmeida Matos ACederquist JGiunti MMatos JRavara A(2023)AtomiS: Data-Centric Synchronization Made PracticalProceedings of the ACM on Programming Languages10.1145/36228017:OOPSLA2(116-145)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622801
Karimipour NPham JClapp LSridharan MChandra SBlincoe KTonella P(2023)Practical Inference of Nullability TypesProceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3611643.3616326(1395-1406)Online publication date: 30-Nov-2023
https://dl.acm.org/doi/10.1145/3611643.3616326
Feldman KKellogg MChaparro OChandra SBlincoe KTonella P(2023)On the Relationship between Code Verifiability and UnderstandabilityProceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3611643.3616242(211-223)Online publication date: 30-Nov-2023
https://dl.acm.org/doi/10.1145/3611643.3616242
Kellogg MDaskiewicz DDuc Nguyen LAhmed MErnst M(2023)Pluggable Type Inference for Free2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE)10.1109/ASE56229.2023.00186(1542-1554)Online publication date: 11-Sep-2023
https://doi.org/10.1109/ASE56229.2023.00186
Gordon CYun C(2023)Error Localization for Sequential Effect SystemsStatic Analysis10.1007/978-3-031-44245-2_16(343-370)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-44245-2_16
Kellogg MSpinellis DGousios GChechik MDi Penta M(2021)Lightweight verification via specialized typecheckersProceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3468264.3473105(1635-1639)Online publication date: 20-Aug-2021
https://dl.acm.org/doi/10.1145/3468264.3473105
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents