article

Open access

Equality-based flow analysis versus recursive types

Author:

Jens PalsbergAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 20, Issue 6

Pages 1251 - 1264

https://doi.org/10.1145/295656.295662

Published: 01 November 1998 Publication History

Abstract

Equality-based control-flow analysis has been studied by Henglein, Bondorf and Jørgensen, DeFouw, Grove, and Chambers, and others. It is faster than the subset-based-0-CFA, but also more approximate. Heintze asserted in 1995 that a program can be safety checked with an equality-based control-flow analysis if and only if it can be typed with recursive types. In this article we falsify Heintze's assertion, and we present a type system equivalent to equality-based control-flow analysis. The new type system contains both recursive types and an unusual notion of subtyping. We have s ≤ t if s and t unfold to the same regular tree, and we have ⊥≤t≤⊤ where t is a function type. In particular, there is no nontrivial subtyping between function types.

References

[1]

AMADIO, R. M. AND CARDELLI, L. 1993. Subtyping recursive types. ACM Trans. Program. Lang. Syst. 15, 4, 575-631.

Digital Library

[2]

ASHLEY, J. M. 1996. A practical and flexible flow analysis for higher-order languages. In Proceedings of POPL '96, 23rd Annual SIGPLAN-SIGA CT Symposium on Principles of Programming Languages. ACM, New York, 184-194.

Digital Library

[3]

BONDORF, t. AND JORGENSEN, J. 1993. Efficient analyses for realistic off-line partial evaluation. J. of Func. Program. 3, 3, 315-346.

[4]

BRUCE, I~. B., CARDELLI, L., CASTAGNA, G., EIFRIG, J., SMITH, S. F., TRIFONOV, V., LEAVENS, G. T., AND PIERCE, B. C. 1995. On binary methods. Theory Pract. Obj. Syst. 1, 3, 221-242.

Digital Library

[5]

DEFouw, G., GROVE, D., AND CHAMBERS, C. 1998. Fast interprocedural class analysis. In Proceedings of POPL '98, 25th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 222-236.

Digital Library

[6]

GOSLING, J., JoY, B., AND STEELE, G. 1996. The Java Language Specification. Addison-Wesley, Reading, Mass.

Digital Library

[7]

HEINTZE, N. 1995. Control-flow analysis and type systems. In Proceedings of SAS'95, International Static Analysis Symposium. Lecture Notes in Computer Science, vol. 983. Springer-Verlag, Berlin, 189-206.

Digital Library

[8]

HEINTZE, N. AND MCALLESTER, D. 1997. Linear-time subtransitive control flow analysis. In Proceedings of ACM SIGPLAN 1997 Conference on Programming Language Design and Iraplementation. ACM, New York, 261-272.

Digital Library

[9]

HENGLEIN, F. 1992. Dynamic typing. In Proceedings of ESOP'92, European Symposium on Programming. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, Berlin, 233-253.

Digital Library

[10]

MILNER, R., WOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. MIT Press, Cambridge, Mass.

Digital Library

[11]

PALSBERG~ J. 1995. Closure analysis in constraint form. ACM Trans. Program. Lang. Syst. 17, 1 (Jan.), 47-62.

Digital Library

[12]

PALSBERG, J. AND O'I~EEFE, P. M. 1995. A type system equivalent to flow analysis. ACM Trans. Program. Lang. Syst. 17, 4 (July), 576-599.

Digital Library

[13]

PALSBERG~ J. AND PAVLOPOULOU~ C. 1998. From polyvariant flow information to intersection and union types. In Proceedings of POPL'98, 25th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 197-208.

Digital Library

[14]

PALSBERG~ J. AND SCHWARTZBACH~ M. I. 1994. Object-Oriented Type Systems. John Wiley & Sons, New York.

Digital Library

[15]

SHAPIRO~ M. AND HORWITZ~ S. 1997. Fast and accurate flow-insensitive points-to analysis. In Proceedings of POPL '97, 2~th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 1-14.

Digital Library

[16]

SHIVERS~ O. 1991. Control-flow analysis of higher-order languages. Ph.D. thesis, CMU-CS-91-145, Carnegie Mellon Univ., Pittsburgh, Pa.

Digital Library

[17]

STEENSGAARD~ B. 1996. Points-to analysis in almost linear time. In Proceedings of POPL'96, 23nd Annual SIGPLAN-SIGA CT Symposium on Principles of Programming Languages. ACM, New York, 32-41.

Digital Library

Cited By

Cathcart Burn TOng CRamsay S(2017)Higher-order constrained horn clauses for verificationProceedings of the ACM on Programming Languages10.1145/31580992:POPL(1-28)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158099
Kobayashi NIgarashi A(2013)Model-Checking higher-order programs with recursive typesProceedings of the 22nd European conference on Programming Languages and Systems10.1007/978-3-642-37036-6_24(431-450)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37036-6_24
Midtgaard J(2012)Control-flow analysis of functional programsACM Computing Surveys10.1145/2187671.218767244:3(1-33)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1145/2187671.2187672
Show More Cited By

Index Terms

Equality-based flow analysis versus recursive types
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

A flow-based approach for variant parametric types
Proceedings of the 2006 OOPSLA Conference

A promising approach for type-safe generic codes in the object-oriented paradigm is variant parametric type, which allows covariant and contravariant subtyping on fields where appropriate. Previous approaches formalise variant type as a special case of ...
Recursive type generativity
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Existential types provide a simple and elegant foundation for understanding generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting to extend ML with support for recursive modules, we have found ...
Recursive type generativity
ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Existential types provide a simple and elegant foundation for understanding generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting to extend ML with support for recursive modules, we have found ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 20, Issue 6

Nov. 1998

212 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/295656

Editor:
William Pugh
Univ. of Maryland, College Park

Issue’s Table of Contents

Copyright © 1998 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: 01 November 1998

Published in TOPLAS Volume 20, Issue 6

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
389
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Cathcart Burn TOng CRamsay S(2017)Higher-order constrained horn clauses for verificationProceedings of the ACM on Programming Languages10.1145/31580992:POPL(1-28)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158099
Kobayashi NIgarashi A(2013)Model-Checking higher-order programs with recursive typesProceedings of the 22nd European conference on Programming Languages and Systems10.1007/978-3-642-37036-6_24(431-450)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37036-6_24
Midtgaard J(2012)Control-flow analysis of functional programsACM Computing Surveys10.1145/2187671.218767244:3(1-33)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1145/2187671.2187672
De Nicola RGorla DHansen RNielson FNielson HProbst CPugliese R(2010)From Flow Logic to static type systems for coordination languagesScience of Computer Programming10.1016/j.scico.2009.07.00975:6(376-397)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.scico.2009.07.009
Millstein TPalsberg J(2009)Type SystemsThe Compiler Design Handbook10.1201/9781420043839.ch9(9-1-9-22)Online publication date: 7-Dec-2009
https://doi.org/10.1201/9781420043839.ch9
Naik MPalsberg J(2008)A type system equivalent to a model checkerACM Transactions on Programming Languages and Systems10.1145/1387673.138767830:5(1-24)Online publication date: 4-Sep-2008
https://dl.acm.org/doi/10.1145/1387673.1387678
(2005)ReferencesMultiprocessor Systems-on-Chips10.1016/B978-012385251-9/50034-7(513-556)Online publication date: 2005
https://doi.org/10.1016/B978-012385251-9/50034-7
Naik MPalsberg J(2005)A type system equivalent to a model checkerProceedings of the 14th European conference on Programming Languages and Systems10.1007/978-3-540-31987-0_26(374-388)Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1007/978-3-540-31987-0_26
Glew NPalsberg J(2004)Type-safe method inliningScience of Computer Programming10.1016/j.scico.2004.03.00952:1-3(281-306)Online publication date: 1-Aug-2004
https://dl.acm.org/doi/10.1016/j.scico.2004.03.009
Palsberg JWand M(2003)CPS transformation of flow informationJournal of Functional Programming10.1017/S095679680200451313:5(905-923)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1017/S0956796802004513
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 Article

Media

Figures

Other

Tables

View Issue’s Table of Contents