Article

Free access

Using abstract interpretation to define a strictness type inference system

Author:

B. MonsuezAuthors Info & Claims

PEPM '95: Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pages 122 - 133

https://doi.org/10.1145/215465.215574

Published: 23 June 1995 Publication History

PDF eReader

References

[1]

N. Benton, Strictness Analysis of Functional Prograls. PhD Thesis, University of Cambridge, 1993.

Google Scholar

[2]

G.L. Burn, C. L. Hankin, and S. Abramsky, The Theory and Practice of Strictness Analysis for Htgher-Order Functions, Research Report 85/06, Imperial College, 1985.

Google Scholar

[3]

P.Cousot, Mdthodes it&atives de construction et d ' approximat~on de points fixes d ' opdrateurs monotones sur un treillis, analyse sdmantique des programmes. Th~se d'Etat, Grenoble 1978.

Google Scholar

[4]

P. Cousot, Semantic foundations of program analys~s, in "Program Flow Analysis : theory and applications" edited by S. Muchnick N. Jones, Prentice Hall 1981.

Google Scholar

[5]

P. &c R. Cousot, Abstract Interpretation: a unifled lattice model for static analysis of program by construction of approx~rnate fixpoints, Conf. rec of the 4th ACM Symposium on POPL, Los Angeles Calif, 239-252, Jan 1977.

Digital Library

Google Scholar

[6]

P. &c R. Cousot, Systematic design of program analysis framework, Conf. rec of the 6th ACM Symposium on POPL, Jan 1979.

Digital Library

Google Scholar

[7]

P. & R. Cousot, Galois Connection Based Ashtract Interpretation for Strictness Analysis, Proc. of the conference FMP93, LNCS 735, Novossibirsk, July 1993.

Digital Library

Google Scholar

[8]

C.A. Gunther D.S. Scott Semantic domainsin J. van Leeuwen (ed.) Formal Models and Semantics. vol. B of Handbook of Theoritical Computer Science, Elsevier 1990.

Digital Library

Google Scholar

[9]

C. Hankin, D. Le M6tayer, Deriving algorithms from type inference systems: Application to strictness analysis, Conf. rec of the 21th ACM Symposium on POPL, Jan 1994

Digital Library

Google Scholar

[10]

T.P. Jensen Strictness Analysis in logical form Proceeding of the 5th ACM Conference on Functional Programming Language and Computer Architecture, LNCS 523, 1991.

Digital Library

Google Scholar

[11]

T.P. Jensen Disjunctive strzctness Analys~s Proceeding of LICS, 1992.

Google Scholar

[12]

G. Kahn, Natural Semantics, "Programming of Future Generation Computers" edited by K. Fuchi, M. Niwt, Elsevier Science Publishers B .V. (North-Holland) 1988.

Google Scholar

[13]

T. Kuo, P. Mishra, Strictness Analys,s: A new Perspective based on Type Inference, Conf. rec of the ACM Symposium on LFP, 1989

Digital Library

Google Scholar

[14]

I. C. Mitchell Coercion and type ~nference, Conf. rec of the ACM Symposium on POPL, 1984

Digital Library

Google Scholar

[15]

B. Monsuez Fractional Types Proceeding of the Workshop on Static Analysis, September 1992, Bordeaux, France, BIGRE 82.

Google Scholar

[16]

B. Monsuez, Polymorphic Typing By Abstract Interpretation, in LNCS 652, Proc. of the conference " FST&TCS ", December 1993, New Delhi.

Digital Library

Google Scholar

[17]

B. Monsuez, Polymorphzc Typing for Call-By- Name Semantics Proc. of the conference FMP93, LNCS 735, Novossibirsk, July 1993.

Digital Library

Google Scholar

[18]

B. Monsuez, Polymorphic Types and Widening Operators in LNCS 724 Proc. of " Workshop on Static Analysis ", Padua, September 1993.

Digital Library

Google Scholar

[19]

A. Mycroft Abstract Interpretation and optimising Transformations for Apphcatzve Programs, Ph.D. Dissertation, CST-15-81, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland, Dec. 1981.

Google Scholar

[20]

A. Mycroft Polymorphic Types Schemes and Recurszve Definitions, in LNCS 167 International Symposium on Programming. 6th Colloquium April 1984, Toulouse.

Digital Library

Google Scholar

[21]

G.D. Plotkin, A Structural Approach to Operational Semantics, DAIMI FN-19, Computer Science Department, Aarhus, Denmark, September 1981.

Google Scholar

[22]

D.A. Schmidt, Denotatzonal Semantics, Allyn and Bacon, 1986.

Google Scholar

[23]

K. L. Solberg, H. R. Nielson, F. Nielson: Strictness and Totality Analysis in LNCS, Proc. of " Static Analysis Symposium ", Namur, September 1994.

Google Scholar

[24]

D.A. Wright, A New Technique for Stmctness Analysis. Theory and Proactice of Software Development, LNCS 494, 1991.

Digital Library

Google Scholar

Cited By

View all

Pavlinovic ZSu YWies T(2021)Data flow refinement type inferenceProceedings of the ACM on Programming Languages10.1145/34343005:POPL(1-31)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434300
Nielson FCousot PDam MDegano PJouvelot PMycroft AThomsen B(2005)Logical and operational methods in the analysis of programs and systemsAnalysis and Verification of Multiple-Agent Languages10.1007/3-540-62503-8_1(1-21)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62503-8_1
Jensen TMacQueen DCardelli L(1998)Inference of polymorphic and conditional strictness propertiesProceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/268946.268964(209-221)Online publication date: 21-Jan-1998
https://dl.acm.org/doi/10.1145/268946.268964
Show More Cited By

Index Terms

Using abstract interpretation to define a strictness type inference system
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs
      2. Type structures
    2. Program semantics
      1. Denotational semantics

Recommendations

Polymorphic type inference and abstract data types
Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...
Practical type inference for the gadt type system

Comments

Information & Contributors

Information

Published In

PEPM '95: Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

June 1995

269 pages

ISBN:0897917200

DOI:10.1145/215465

Chairman:
Neil Jones
Univ. of Copenhagen, Copenhagen, Denmark

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: 23 June 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PEPM95

Sponsor:

SIGPLAN

PEPM95: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation

June 21 - 23, 1995

California, La Jolla, USA

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
253
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)11

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pavlinovic ZSu YWies T(2021)Data flow refinement type inferenceProceedings of the ACM on Programming Languages10.1145/34343005:POPL(1-31)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434300
Nielson FCousot PDam MDegano PJouvelot PMycroft AThomsen B(2005)Logical and operational methods in the analysis of programs and systemsAnalysis and Verification of Multiple-Agent Languages10.1007/3-540-62503-8_1(1-21)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62503-8_1
Jensen TMacQueen DCardelli L(1998)Inference of polymorphic and conditional strictness propertiesProceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/268946.268964(209-221)Online publication date: 21-Jan-1998
https://dl.acm.org/doi/10.1145/268946.268964
Cousot PLee PHenglein FJones N(1997)Types as abstract interpretationsProceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/263699.263744(316-331)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1145/263699.263744

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Polymorphic type inference and abstract data types

Polymorphic type inference and abstract data types

Practical type inference for the gadt type system

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Polymorphic type inference and abstract data types

Polymorphic type inference and abstract data types

Practical type inference for the gadt type system

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations