Lionel Parreaux

According to our database, Lionel Parreaux authored at least 18 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism.

Lionel Parreaux, Aleksander Boruch-Gruszecki, Andong Fan, Chun Yin Chau

Proc. ACM Program. Lang., January, 2024

Being Lazy When It Counts - Practical Constant-Time Memory Management for Functional Programming.

Chun Kit Lam, Lionel Parreaux

Proceedings of the Functional and Logic Programming - 17th International Symposium, 2024

2023

Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference.

Ishan Bhanuka, Lionel Parreaux, David Binder, Jonathan Immanuel Brachthäuser

Proc. ACM Program. Lang., October, 2023

super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion (Artifact).

Andong Fan, Lionel Parreaux

Dagstuhl Artifacts Ser., 2023

super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion.

Andong Fan, Lionel Parreaux

Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

2022

MLstruct: principal type inference in a Boolean algebra of structural types.

Lionel Parreaux, Chun Yin Chau

Proc. ACM Program. Lang., 2022

A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning.

Aleksander Boruch-Gruszecki, Radoslaw Wasko, Yichen Xu, Lionel Parreaux

Proc. ACM Program. Lang., 2022

2021

Implementing path-dependent GADT reasoning for Scala 3.

Yichen Xu, Aleksander Boruch-Gruszecki, Lionel Parreaux

Proceedings of the SCALA 2021: Proceedings of the 12th ACM SIGPLAN International Symposium on Scala, 2021

Comprehending Monoids with Class.

Lionel Parreaux

Proceedings of the DBPL '21: The 18th International Symposium on Database Programming Languages, 2021

2020

Type-Safe Metaprogramming and Compilation Techniques For Designing Efficient Systems in High-Level Languages.

Lionel Parreaux

PhD thesis, 2020

The simple essence of algebraic subtyping: principal type inference with subtyping made easy (functional pearl).

Lionel Parreaux

Proc. ACM Program. Lang., 2020

Multi-stage programming in the large with staged classes.

Lionel Parreaux, Amir Shaikhha

Proceedings of the GPCE '20: Proceedings of the 19th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2020

2019

Towards improved GADT reasoning in Scala.

Lionel Parreaux, Aleksander Boruch-Gruszecki, Paolo G. Giarrusso

Proceedings of the Tenth ACM SIGPLAN Symposium on Scala, 2019

Finally, a Polymorphic Linear Algebra Language (Pearl).

Amir Shaikhha, Lionel Parreaux

Proceedings of the 33rd European Conference on Object-Oriented Programming, 2019

2018

Unifying analytic and statically-typed quasiquotes.

Lionel Parreaux, Antoine Voizard, Amir Shaikhha, Christoph E. Koch

Proc. ACM Program. Lang., 2018

2017

Squid: type-safe, hygienic, and reusable quasiquotes.

Lionel Parreaux, Amir Shaikhha, Christoph E. Koch

Proceedings of the 8th ACM SIGPLAN International Symposium on Scala, 2017

Quoted staged rewriting: a practical approach to library-defined optimizations.

Lionel Parreaux, Amir Shaikhha, Christoph E. Koch

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2017

2016

How to Architect a Query Compiler.

Amir Shaikhha, Yannis Klonatos, Lionel Parreaux, Lewis Brown, Mohammad Dashti, Christoph Koch

Proceedings of the 2016 International Conference on Management of Data, 2016