A Coq library of undecidable problems Y Forster, D Larchey-Wendling, A Dudenhefner, E Heiter, D Kirst, F Kunze, ... CoqPL 2020 The Sixth International Workshop on Coq for Programming Languages, 2020 | 45 | 2020 |
Combinatory logic synthesizer J Bessai, A Dudenhefner, B Düdder, M Martens, J Rehof Leveraging Applications of Formal Methods, Verification and Validation …, 2014 | 40 | 2014 |
Intersection type calculi of bounded dimension A Dudenhefner, J Rehof ACM SIGPLAN Notices 52 (1), 653-665, 2017 | 25 | 2017 |
Combinatory process synthesis J Bessai, A Dudenhefner, B Düdder, M Martens, J Rehof Leveraging Applications of Formal Methods, Verification and Validation …, 2016 | 21 | 2016 |
Typability in bounded dimension A Dudenhefner, J Rehof 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 16 | 2017 |
Mixin composition synthesis based on intersection types J Bessai, TC Chen, A Dudenhefner, B Düdder, U de'Liguoro, J Rehof Logical Methods in Computer Science 14, 2018 | 15 | 2018 |
Extracting a formally verified subtyping algorithm for intersection types from ideals and filters J Bessai, A Dudenhefner, B Düdder, J Rehof Talk at COST Types, 2016 | 13 | 2016 |
Mixin composition synthesis based on intersection types J Bessai, A Dudenhefner, TC Chen, U De'Liguoro, J Rehof LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 38, 76-91, 2015 | 11 | 2015 |
A simpler undecidability proof for system F inhabitation A Dudenhefner, J Rehof 24th International Conference on Types for Proofs and Programs (TYPES 2018), 2019 | 10 | 2019 |
Typing classes and mixins with intersection types J Bessai, B Düdder, A Dudenhefner, TC Chen, U de'Liguoro arXiv preprint arXiv:1503.04911, 2015 | 10 | 2015 |
The complexity of principal inhabitation A Dudenhefner, J Rehof 2nd International Conference on Formal Structures for Computation and …, 2017 | 9 | 2017 |
A Coq library for mechanised first-order logic D Kirst, J Hostert, A Dudenhefner, Y Forster, M Hermes, M Koch, ... The Coq Workshop 2022, 2022 | 8 | 2022 |
Undecidability of semi-unification on a napkin A Dudenhefner 5th International Conference on Formal Structures for Computation and …, 2020 | 8 | 2020 |
The algebraic intersection type unification problem A Dudenhefner, M Martens, J Rehof Logical Methods in Computer Science 13, 2017 | 8 | 2017 |
Constructive many-one reduction from the halting problem to semi-unification A Dudenhefner 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), 2022 | 7 | 2022 |
Delegation-based mixin composition synthesis J Bessai, B Düdder, A Dudenhefner, M Martens Proceedings of Intersection Types and Related Systems (ITRS’14), Lecture …, 2014 | 7 | 2014 |
Undecidability of dyadic first-order logic in Coq J Hostert, A Dudenhefner, D Kirst 13th International Conference on Interactive Theorem Proving (ITP 2022), 2022 | 6 | 2022 |
The undecidability of system F typability and type checking for reductionists A Dudenhefner 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2021 | 5 | 2021 |
Rank 3 Inhabitation of Intersection Types Revisited (Extended Version) A Dudenhefner, J Rehof arXiv preprint arXiv:1705.06070, 2017 | 5 | 2017 |
The intersection type unification problem A Dudenhefner, M Martens, J Rehof 1st International Conference on Formal Structures for Computation and …, 2016 | 5 | 2016 |