Andrej Dudenhefner

Andrej Dudenhefner

Technische Universität Dortmund

H-index: 10

Europe-Germany

About Andrej Dudenhefner

Andrej Dudenhefner, With an exceptional h-index of 10 and a recent h-index of 9 (since 2020), a distinguished researcher at Technische Universität Dortmund, specializes in the field of Type Theory, Computational Logic, Program Synthesis.

His recent articles reflect a diverse array of research interests and contributions to the field:

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

A Coq library for mechanised first-order logic

Certified decision procedures for two-counter machines

Undecidability of dyadic first-order logic in Coq

Generating Infrastructural Code for Terms with Binders using MetaCoq and OCaml

The undecidability of system F typability and type checking for reductionists

Kripke semantics for intersection formulas

A Coq library of undecidable problems

Andrej Dudenhefner Information

University

Position

Department of Computer Science Germany

Citations(all)

300

Citations(since 2020)

231

Cited By

185

hIndex(all)

10

hIndex(since 2020)

9

i10Index(all)

11

i10Index(since 2020)

7

Email

University Profile Page

Technische Universität Dortmund

Google Scholar

View Google Scholar Profile

Andrej Dudenhefner Skills & Research Interests

Type Theory

Computational Logic

Program Synthesis

Top articles of Andrej Dudenhefner

Title

Journal

Author(s)

Publication Date

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

Logical Methods in Computer Science

Andrej Dudenhefner

2023/12/8

A Coq library for mechanised first-order logic

Dominik Kirst

Johannes Hostert

Andrej Dudenhefner

Yannick Forster

Marc Hermes

...

2022/8/12

Certified decision procedures for two-counter machines

Andrej Dudenhefner

2022

Undecidability of dyadic first-order logic in Coq

Johannes Hostert

Andrej Dudenhefner

Dominik Kirst

2022

Generating Infrastructural Code for Terms with Binders using MetaCoq and OCaml

Bachelor Thesis. Saarland University

Adrian Dapprich

Andrej Dudenhefner

2021/11/3

The undecidability of system F typability and type checking for reductionists

Andrej Dudenhefner

2021/6/29

Kripke semantics for intersection formulas

ACM Transactions on Computational Logic (TOCL)

Andrej Dudenhefner

Paweł Urzyczyn

2021/6/28

A Coq library of undecidable problems

Yannick Forster

Dominique Larchey-Wendling

Andrej Dudenhefner

Edith Heiter

Dominik Kirst

...

2020/1/25

Undecidability of semi-unification on a napkin

Andrej Dudenhefner

2020

See List of Professors in Andrej Dudenhefner University(Technische Universität Dortmund)