Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back

Author:

Brachthäuser Jonathan Immanuel1ORCID,Schuster Philipp1ORCID,Lee Edward2ORCID,Boruch-Gruszecki Aleksander3ORCID

Affiliation:

1. University of Tübingen, Germany

2. University of Waterloo, Canada

3. EPFL, Switzerland

Abstract

Reasoning about the use of external resources is an important aspect of many practical applications. Effect systems enable tracking such information in types, but at the cost of complicating signatures of common functions. Capabilities coupled with escape analysis offer safety and natural signatures, but are often overly coarse grained and restrictive. We present System C, which builds on and generalizes ideas from type-based escape analysis and demonstrates that capabilities and effects can be reconciled harmoniously. By assuming that all functions are second class, we can admit natural signatures for many common programs. By introducing a notion of boxed values, we can lift the restrictions of second-class values at the cost of needing to track degree-of-impurity information in types. The system we present is expressive enough to support effect handlers in full capacity. We practically evaluate System C in an implementation and prove its soundness.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference56 articles.

1. Asynchronous effects

2. Engineering formal metatheory

3. Henk P. Barendregt . 1992. Lambda Calculi with Types . In Handbook of Logic in Computer Science (vol. 2): Background: Computational Structures . Oxford University Press , New York, NY, USA . 117–309. Henk P. Barendregt. 1992. Lambda Calculi with Types. In Handbook of Logic in Computer Science (vol. 2): Background: Computational Structures. Oxford University Press, New York, NY, USA. 117–309.

4. Yves Bertot and Pierre Castéran . 2004. Interactive Theorem Proving and Program Development , Coq’Art:The Calculus of Inductive Constructions . Springer-Verlag . Yves Bertot and Pierre Castéran. 2004. Interactive Theorem Proving and Program Development, Coq’Art:The Calculus of Inductive Constructions. Springer-Verlag.

5. Binders by day, labels by night: effect instances via lexically scoped handlers

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Effectful Software Contracts;Proceedings of the ACM on Programming Languages;2024-01-05

2. Explicit Effects and Effect Constraints in ReML;Proceedings of the ACM on Programming Languages;2024-01-05

3. Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs;Proceedings of the ACM on Programming Languages;2024-01-05

4. Capturing Types;ACM Transactions on Programming Languages and Systems;2023-11-20

5. Reference Capabilities for Flexible Memory Management;Proceedings of the ACM on Programming Languages;2023-10-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3