Andrej Dudenhefner

According to our database, Andrej Dudenhefner authored at least 22 papers between 2014 and 2023.

Collaborative distances:

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

2023

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version).

Andrej Dudenhefner

Log. Methods Comput. Sci., 2023

2022

Undecidability of Dyadic First-Order Logic in Coq.

Johannes Hostert, Andrej Dudenhefner, Dominik Kirst

Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

Certified Decision Procedures for Two-Counter Machines.

Andrej Dudenhefner

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Constructive Many-One Reduction from the Halting Problem to Semi-Unification.

Andrej Dudenhefner

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021

Kripke Semantics for Intersection Formulas.

Andrej Dudenhefner, Pawel Urzyczyn

ACM Trans. Comput. Log., 2021

The Undecidability of System F Typability and Type Checking for Reductionists.

Andrej Dudenhefner

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Undecidability of Semi-Unification on a Napkin.

Andrej Dudenhefner

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Algorithmic aspects of type-based program sythesis.

Andrej Dudenhefner

PhD thesis, 2019

Principality and approximation under dimensional bound.

Andrej Dudenhefner, Jakob Rehof

Proc. ACM Program. Lang., 2019

Undecidability of Intersection Type Inhabitation at Rank 3 and its Formalization.

Andrej Dudenhefner, Jakob Rehof

Fundam. Informaticae, 2019

2018

Mixin Composition Synthesis based on Intersection Types.

Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de'Liguoro, Jakob Rehof

Log. Methods Comput. Sci., 2018

A Simpler Undecidability Proof for System F Inhabitation.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 24th International Conference on Types for Proofs and Programs, 2018

2017

The Algebraic Intersection Type Unification Problem.

Andrej Dudenhefner, Moritz Martens, Jakob Rehof

Log. Methods Comput. Sci., 2017

Rank 3 Inhabitation of Intersection Types Revisited (Extended Version).

Andrej Dudenhefner, Jakob Rehof

CoRR, 2017

Lower End of the Linial-Post Spectrum.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 23rd International Conference on Types for Proofs and Programs, 2017

The Complexity of Principal Inhabitation.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Intersection type calculi of bounded dimension.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Typability in bounded dimension.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

The Intersection Type Unification Problem.

Andrej Dudenhefner, Moritz Martens, Jakob Rehof

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Combinatory Process Synthesis.

Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

2014

Typing Classes and Mixins with Intersection Types.

Jan Bessai, Boris Düdder, Andrej Dudenhefner, Tzu-Chun Chen, Ugo de'Liguoro

Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

Combinatory Logic Synthesizer.

Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014