12 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.PL2024
The Long Way to Deforestation (Technical Report): A Type Inference and Elaboration Technique for Removing Intermediate Data Structures
Yijia Chen, Lionel Parreaux
Deforestation is a compiler optimization that removes intermediate data structure allocations from functional programs to improve their efficiency. This is an old idea, but previou…
cs.PL2024★ 12 cited
Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference
Ishan Bhanuka, Lionel Parreaux, David Binder +1
Creating good type error messages for constraint-based type inference systems is difficult. Typical type error messages reflect implementation details of the underlying constraint-…
cs.PL2022★ 1 cited
A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning
Aleksander Boruch-Gruszecki, Radosław Waśko, Yichen Xu +1
Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotl…