Lionel Parreaux

Orcid: 0000-0002-8805-0728

Affiliations:
  • Hong Kong University of Science and Technology, China


According to our database1, Lionel Parreaux authored at least 22 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism.
Proc. ACM Program. Lang., January, 2024

Fast and Optimal Extraction for Sparse Equality Graphs.
Proc. ACM Program. Lang., 2024

The Ultimate Conditional Syntax.
Proc. ACM Program. Lang., 2024

The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures.
Proc. ACM Program. Lang., 2024

The Long Way to Deforestation (Technical Report): A Type Inference and Elaboration Technique for Removing Intermediate Data Structures.
CoRR, 2024

Being Lazy When It Counts - Practical Constant-Time Memory Management for Functional Programming.
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.
Proc. ACM Program. Lang., October, 2023

super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion (Artifact).
Dagstuhl Artifacts Ser., 2023

super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

2022
MLstruct: principal type inference in a Boolean algebra of structural types.
Proc. ACM Program. Lang., 2022

A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning.
Proc. ACM Program. Lang., 2022

2021
Implementing path-dependent GADT reasoning for Scala 3.
Proceedings of the SCALA 2021: Proceedings of the 12th ACM SIGPLAN International Symposium on Scala, 2021

Comprehending Monoids with Class.
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.
PhD thesis, 2020

The simple essence of algebraic subtyping: principal type inference with subtyping made easy (functional pearl).
Proc. ACM Program. Lang., 2020

Multi-stage programming in the large with staged classes.
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.
Proceedings of the Tenth ACM SIGPLAN Symposium on Scala, 2019

Finally, a Polymorphic Linear Algebra Language (Pearl).
Proceedings of the 33rd European Conference on Object-Oriented Programming, 2019

2018
Unifying analytic and statically-typed quasiquotes.
Proc. ACM Program. Lang., 2018

2017
Squid: type-safe, hygienic, and reusable quasiquotes.
Proceedings of the 8th ACM SIGPLAN International Symposium on Scala, 2017

Quoted staged rewriting: a practical approach to library-defined optimizations.
Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2017

2016
How to Architect a Query Compiler.
Proceedings of the 2016 International Conference on Management of Data, 2016


  Loading...