Guillaume Allais

Orcid: 0000-0002-4091-657X

According to our database1, Guillaume Allais authored at least 13 papers between 2012 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Scoped and Typed Staging by Evaluation.
Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, 2024

2023
Seamless, Correct, and Generic Programming over Serialised Data.
CoRR, 2023

Frex: dependently-typed algebraic simplification.
CoRR, 2023

Builtin Types Viewed as Inductive Families.
Proceedings of the Programming Languages and Systems, 2023

Type Theory as a Language Workbench.
Proceedings of the Eelco Visser Commemorative Symposium, 2023

2019
POPLMark reloaded: Mechanizing proofs by logical relations.
J. Funct. Program., 2019

Generic level polymorphic n-ary functions.
Proceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development, 2019

2018
A type and scope safe universe of syntaxes with binding: their semantics and proofs.
Proc. ACM Program. Lang., 2018

2017
Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic.
Proceedings of the 23rd International Conference on Types for Proofs and Programs, 2017

Type-and-scope safe programs and their proofs.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2014
Views of PI: Definition and computation.
J. Formaliz. Reason., 2014

2013
New equations for neutral terms: a sound and complete decision procedure, formalized.
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, 2013

2012
On the Formalization of Termination Techniques based on Multiset Orderings.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012


  Loading...