Article

Free access

A relational approach to strictness analysis for higher-order polymorphic functions

Authors:

Samson Abramsky,

Thomas P. JensenAuthors Info & Claims

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 49 - 54

https://doi.org/10.1145/99583.99593

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

S. Abramsky. Strictness analysis and polymorphic invariance. In tI. Ganzinger and N. D. Jones, editors, Programs as Data Objects, pages 1-23, Berlin, 1986. Springer Verlag. Lecture Notes in Computer Science Vol. 217.

Digital Library

Google Scholar

[2]

S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1, 1990.

Google Scholar

[3]

S. Abramsky and C. Hankin. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.

Digital Library

Google Scholar

[4]

S. Abramsky, J. Mitchell, A. Scedrov, and P. Wadler. Relators. Draft paper, 1990.

Google Scholar

[5]

E. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott. Functorial polymorphism. In G. Huet, editor, Logical Foundations of Functional Programming. Addison Wesley, 1990.

Google Scholar

[6]

M. Barr and C. Wells. Category Theory for Computing Science. Prentice Hall, 1990.

Digital Library

Google Scholar

[7]

G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Imperial College, University of London, 1987.

Google Scholar

[8]

G.L. Burn, C.L. Hankin, and S. Abramsky. The theory and practice of strictness analysis for higher order functions. Science of Computer Programming, 7:249- 278, 1986.

Digital Library

Google Scholar

[9]

P. Freyd. Structural polymorphism. Unpublished, 1989.

Google Scholar

[10]

R.J.M. Hughes. Abstract interpretation of first-order polymorphic functions. In Glasgow Workshop on Func= tional Programming, University of Glasgow, Department of Computing Science, August 1988. Research Report 89/R4.

Google Scholar

[11]

S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.

Digital Library

Google Scholar

[12]

S. MacLane. Categories }or the Working Mathematician. Springer Verlag, 1971.

Google Scholar

[13]

G. D. Plotkin. ),-definability and logical relations. Technical Report SAI-R.M-4, School of A.I., University of Edinburgh, 1973.

Google Scholar

[14]

J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83. North Holland, 1983.

Google Scholar

Cited By

View all

Di Pierro A(2020)A Type Theory for Probabilistic $$\lambda $$–calculusFrom Lambda Calculus to Cybersecurity Through Program Analysis10.1007/978-3-030-41103-9_3(86-102)Online publication date: 15-Feb-2020
https://doi.org/10.1007/978-3-030-41103-9_3
Mitchell JScedrov A(2005)Notes on sconing and relatorsComputer Science Logic10.1007/3-540-56992-8_21(352-378)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-56992-8_21
Ma QReynolds J(2005)Types, abstraction, and parametric polymorphism, part 2Mathematical Foundations of Programming Semantics10.1007/3-540-55511-0_1(1-40)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55511-0_1
Show More Cited By

Index Terms

A relational approach to strictness analysis for higher-order polymorphic functions
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Procedures, functions and subroutines
      2. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs

Recommendations

Definitional Interpreters for Higher-Order Programming Languages

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Typing higher-order polymorphic functions with dynamic dispatching
Definitional interpreters for higher-order programming languages
ACM '72: Proceedings of the ACM annual conference - Volume 2

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1991

366 pages

ISBN:0897914198

DOI:10.1145/99583

Chairman:
David Wise
Indiana Univ., Bloomington

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: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL91

Sponsor:

POPL91: 18th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

January 21 - 23, 1991

Florida, Orlando, USA

Acceptance Rates

POPL '91 Paper Acceptance Rate 31 of 152 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)5

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Di Pierro A(2020)A Type Theory for Probabilistic $$\lambda $$–calculusFrom Lambda Calculus to Cybersecurity Through Program Analysis10.1007/978-3-030-41103-9_3(86-102)Online publication date: 15-Feb-2020
https://doi.org/10.1007/978-3-030-41103-9_3
Mitchell JScedrov A(2005)Notes on sconing and relatorsComputer Science Logic10.1007/3-540-56992-8_21(352-378)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-56992-8_21
Ma QReynolds J(2005)Types, abstraction, and parametric polymorphism, part 2Mathematical Foundations of Programming Semantics10.1007/3-540-55511-0_1(1-40)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55511-0_1
Brookes S(2002)The essence of parallel AlgolInformation and Computation10.1006/inco.2002.2995179:1(118-149)Online publication date: 25-Nov-2002
https://dl.acm.org/doi/10.1006/inco.2002.2995
Brookes S(1996)The essence of parallel AlgolProceedings of the 11th Annual IEEE Symposium on Logic in Computer Science10.5555/788018.788827Online publication date: 27-Jul-1996
https://dl.acm.org/doi/10.5555/788018.788827
Brookes S(1996)The essence of parallel AlgolProceedings 11th Annual IEEE Symposium on Logic in Computer Science10.1109/LICS.1996.561315(164-173)Online publication date: 1996
https://doi.org/10.1109/LICS.1996.561315
Robinson ERosolini G(1994)Reflexive graphs and parametric polymorphismProceedings Ninth Annual IEEE Symposium on Logic in Computer Science10.1109/LICS.1994.316053(364-371)Online publication date: 1994
https://doi.org/10.1109/LICS.1994.316053
Cousot PCousot R(1994)Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)10.1109/ICCL.1994.288389(95-112)Online publication date: 1994
https://doi.org/10.1109/ICCL.1994.288389
Seward JSchmidt D(1993)Polymorphic strictness analysis using frontiersProceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/154630.154649(186-193)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/154630.154649
Ma QSethi R(1992)Parametricity as subtypingProceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/143165.143225(281-292)Online publication date: 1-Feb-1992
https://dl.acm.org/doi/10.1145/143165.143225
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Definitional Interpreters for Higher-Order Programming Languages

Typing higher-order polymorphic functions with dynamic dispatching

Definitional interpreters for higher-order programming languages