Foundations of strong call by need
Autores: Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner
Proceedings of the ACM on Programming Languages
2017
Citas: 26
Citas por Año
Citas Importadas de Google Scholar
| # | Título del Artículo | Año | Fuente / Journal | Autores |
|---|---|---|---|---|
| 1 | Environments and the complexity of abstract machines | 2017 | - | Beniamino Accattoli, Bruno Barras |
| 2 | Strong Call-by-Value is Reasonable, Implosively | 2021 | - | Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen |
| 3 | Types by Need | 2019 | - | Beniamino Accattoli, Giulio Guerrieri, Maico Leberle |
| 4 | (In)Efficiency and Reasonable Cost Models | 2018 | - | Beniamino Accattoli |
| 5 | Pattern Matching and Fixed Points | 2018 | - | Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed |
| 6 | A Derived Reasonable Abstract Machine for Strong Call by Value | 2021 | - | Małgorzata Biernacka, Witold Charatonik, Tomasz Drab |
| 7 | A simple and efficient implementation of strong call by need by an abstract machine | 2022 | - | Małgorzata Biernacka, Witold Charatonik, Tomasz Drab |
| 8 | Quantitative Weak Linearisation | 2022 | - | Sandra Alves, Daniel Ventura |
| 9 | The Spirit of Node Replication | 2021 | - | Delia Kesner, Loïc Peyrot, Daniel Ventura |
| 10 | Solvability = Typability + Inhabitation | 2021 | - | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
| 11 | A strong call-by-need calculus | 2023 | - | Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond |
| 12 | Sharing a Perspective on the 𝜆-Calculus | 2023 | - | Beniamino Accattoli |
| 13 | Node Replication: Theory And Practice | 2024 | - | Delia Kesner, Loïc Peyrot, Daniel Ventura |
| 14 | Inhabitation for Non-idempotent Intersection Types | 2018 | - | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
| 15 | Strong Call-by-Value is Reasonable, Implosively | 2021 | - | Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen |
| 16 | A Quantitative Understanding of Pattern Matching | 2019 | - | Sandra Alves, Delia Kesner, Daniel Ventura |
| 17 | Strong Call by Value is Reasonable for Time | 2021 | - | Małgorzata Biernacka, Witold Charatonik, Tomasz Drab |
| 18 | Types by Need (Extended Version) | 2019 | - | Beniamino Accattoli, Giulio Guerrieri, Maico Leberle |
| 19 | Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software | 2023 | - | |
| 20 | Observability = Typability + Inhabitation | 2018 | - | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
| 21 | An Abstract Machine for Strong Call by Value | 2020 | - | Małgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab |
| 22 | Useful Open Call-By-Need | 2021 | - | Beniamino Accattoli, Maico Leberle |
| 23 | Node Replication: Theory And Practice | 2022 | - | Delia Kesner, Loïc Peyrot, Daniel Ventura |
| 24 | Sharing and Linear Logic with Restricted Access | 2025 | - | Pablo Barenbaum, Eduardo Bonelli |
| 25 | Formal Development for a Node Replication Calculus with Abstract Machine Extraction for a Lazy Strategy | 2025 | - | Felipe Costa, Daniel Ventura |
| 26 | A Lazy, Concurrent Convertibility Checker | 2026 | - | Nathanaëlle Courant, Xavier Leroy |
El PDF fue subido pero no se pudieron extraer referencias ni figuras del documento.