skip to main content
10.1145/3316615.3316668acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicscaConference Proceedingsconference-collections
research-article

ML Polymorphism of Linear Lambda Calculus with First-class Continuations

Published: 19 February 2019 Publication History

Abstract

The Curry-Howard isomorphism shows that an intuitionistic deductive system is similar to a formal computational system; propositions correspond to types, proofs to lambda-terms, and a proof normalization procedure to an evaluation strategy. Furthermore, the duality between computation values and continuations is discovered under the Curry-Howard isomorphism. In the traditional lambda calculus, duplication and erasing of values are allowed but those of continuations prohibited. On the other hand, in the lambda calculus with first-class continuations, both values and continuations are permitted to be duplicated and erased. In our previous paper, we proposed a linear lambda calculus with first-class continuations, in which we cannot duplicate and erase values but can do continuations.
In this paper, we propose an ML polymorphic type system for the linear lambda calculus with first-class continuations and design a type inference algorithm of the type system.

References

[1]
GIRARD, J.-Y., AND LAFONT, Y. Proof and types, vol. 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
[2]
WELLS, J. B. Typability and type checking in the second-order lambda-calculus are equivalent and undecidable. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS) (1994), IEEE Computer Society Press.
[3]
DAMAS, L., AND MILNER, R. Principal type-schemes for functional programs. In Conference Record of the Nineth Annual ACM Symposium on Principles of Programming Languages (1982), pp. 207--212.
[4]
GUNTER, C. A. Semantics of programming languages: structures and techniques. The MIT Press, 1992.
[5]
GIRARD, J.-Y. Linear Logic. Theoretical Comptuer Science 50 (1987), 1--101.
[6]
NISHIZAKI, S. Linear lambda calculus with non-linear first-class continuations. In Proceedings of the 6th International Conference on Software and Computer Applications (2017), ACM New York, pp. 28--32.
[7]
FILINSKI, A. Declarative continuations and categorical duality, 1989.
[8]
GRIFFIN, T. G. A formulae-as-types notion of control. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages (1990).
[9]
MURTHY, C. An evaluation semantics for classical proofs. In Proc. 5th IEEE Anual Symposium on Logic in Computer Science (1991), IEEE Computer Society Press.
[10]
NISHIZAKI, S. Polymorphic environment calculus and its type inference algorithm. Higher-Order and Symbolic Computation 13, 3 (2000).
[11]
NISHIZAKI, S. Evaluation strategy and translation of environment calculus. In Information Computing and Applications (2013), vol. 391 of Communications in Computer and Information Science, Springer, pp. 232--242.
[12]
KUMA, E., NISHIZAKI, S., AND WATANABE, T. Modifiable continuation in object calculus. In Theory and Practice of Computation (2012), vol. 5 of Proceedings of Information and Communications Technology, Springer Japan, pp. 160--173.
[13]
MATSUMOTO, S., AND NISHIZAKI, S. An object calculus with remote method invocation. In Theory and Practice of Computation (2013), vol. 7 of Proceedings in Information and Communications Technology, Springer Japan, pp. 34--49.
[14]
TOMIOKA, D., NISHIZAKI, S., AND IKEDA, R. A cost estimation calculus for analyzing the resistance to denial-of-service attack. In Software Security - Theories and Systems (2004), vol. 3233 of Lecture Notes in Computer Science, Springer Berlin, pp. 25--44.
[15]
NISHIZAKI, S., FUJII, M., AND IKEDA, R. Process Calculus for Cost Analysis of Process Creation. In Proceedings of the 2012 International Conference on Information Technology and Software Engineering (2013), Lecture Notes in Electrical Engineering, Springer-Verlag Berlin Heidelberg, pp. 33--40.
[16]
OHATA, T., AND NISHIZAKI, S. Let-binding with regular expressions in lambda calculus. Journal of Software 11, 2 (2016), 220--229.
[17]
OHATA, T., AND NISHIZAKI, S. Real-time model checking for regulatory compliance. In AIM 2012 (2013), vol. 296 of Communications in Computer and Information Science, Springer, pp. 70--77.

Index Terms

  1. ML Polymorphism of Linear Lambda Calculus with First-class Continuations

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Other conferences
        ICSCA '19: Proceedings of the 2019 8th International Conference on Software and Computer Applications
        February 2019
        611 pages
        ISBN:9781450365734
        DOI:10.1145/3316615
        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]

        In-Cooperation

        • University of New Brunswick: University of New Brunswick

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 19 February 2019

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. Curry-Howard isomorphism
        2. ML type system
        3. Programming language theory
        4. continuations
        5. functional programming language
        6. lambda calculus
        7. linear logic

        Qualifiers

        • Research-article
        • Research
        • Refereed limited

        Conference

        ICSCA '19

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 38
          Total Downloads
        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 08 Feb 2025

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media