Jesper Cockx

According to our database1, Jesper Cockx authored at least 14 papers between 2014 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
The taming of the rew: a type theory with computational assumptions.
Proc. ACM Program. Lang., 2021

2020
Elaborating dependent (co)pattern matching: No pattern left behind.
J. Funct. Program., 2020

Leibniz equality is isomorphic to Martin-Löf identity, parametrically.
J. Funct. Program., 2020

2019
Definitional proof-irrelevance without K.
Proc. ACM Program. Lang., 2019

Type Theory Unchained: Extending Agda with User-Defined Rewrite Rules.
Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

2018
Elaborating dependent (co)pattern matching.
Proc. ACM Program. Lang., 2018

Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory.
J. Funct. Program., 2018

2017
Dependent Pattern Matching and Proof-Relevant Unification.
PhD thesis, 2017

Expressive and strongly type-safe code generation.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

Lifting proof-relevant unification to higher dimensions.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Eliminating dependent pattern matching without K.
J. Funct. Program., 2016

Unifiers as equivalences: proof-relevant unification of dependently typed data.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2014
Pattern matching without K.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Overlapping and Order-Independent Patterns - Definitional Equality for All.
Proceedings of the Programming Languages and Systems, 2014


  Loading...