Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework-Reference-Cited by-同舟云学术

Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework

Published:2023-01-09 Issue:POPL Volume:7 Page:1483-1513
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Arrial Victor¹^ORCID,Guerrieri Giulio²^ORCID,Kesner Delia³^ORCID

Affiliation:

1. Université Paris Cité - CNRS - IRIF, France

2. Aix Marseille Université - CNRS - LIS, France / Edinburgh Research Centre - Central Software Institute - Huawei, UK

3. Université Paris Cité - CNRS - IRIF, France / Institut Universitaire de France, France

Abstract

We solve the inhabitation problem for a language called λ!, a subsuming paradigm (inspired by call-by-push-value) being able to encode, among others, call-by-name and call-by-value strategies of functional programming. The type specification uses a non-idempotent intersection type system, which is able to capture quantitative properties about the dynamics of programs. As an application, we show how our general methodology can be used to derive inhabitation algorithms for different lambda-calculi that are encodable into λ!.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3571244

Reference47 articles.

1. Tight typings and split bounds, fully developed

2. Beniamino Accattoli and Giulio Guerrieri . 2022. Call-by-Value Solvability and Multi Types. CoRR, abs/2202.03079 ( 2022 ), arXiv:2202.03079. arxiv:2202.03079 Beniamino Accattoli and Giulio Guerrieri. 2022. Call-by-Value Solvability and Multi Types. CoRR, abs/2202.03079 (2022), arXiv:2202.03079. arxiv:2202.03079

3. The theory of call-by-value solvability

4. Beniamino Accattoli and Delia Kesner . 2010 . The structural lambda-calculus . In Proceedings of 24th EACSL Conference on Computer Science Logic, Anuj Dawar and Helmut Veith (Eds.) (LNCS , Vol. 6247). Springer, 381– 395 . Beniamino Accattoli and Delia Kesner. 2010. The structural lambda-calculus. In Proceedings of 24th EACSL Conference on Computer Science Logic, Anuj Dawar and Helmut Veith (Eds.) (LNCS, Vol. 6247). Springer, 381–395.

5. Beniamino Accattoli and Luca Paolini . 2012 . Call-by-Value Solvability, Revisited. In FLOPS , Tom Schrijvers and Peter Thiemann (Eds.) (LNCS , Vol. 7294). Springer, 4– 16 . Beniamino Accattoli and Luca Paolini. 2012. Call-by-Value Solvability, Revisited. In FLOPS, Tom Schrijvers and Peter Thiemann (Eds.) (LNCS, Vol. 7294). Springer, 4–16.

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

1. Higher Order Bayesian Networks, Exactly;Proceedings of the ACM on Programming Languages;2024-01-05

2. Taylor Expansion as a Monad in Models of DiLL;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26