default search action
Andrej Dudenhefner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Andrej Dudenhefner
, Daniele Pautasso
Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions. FSCD 2024: 8:1-8:20 - 2023
- [j6]Andrej Dudenhefner
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version). Log. Methods Comput. Sci. 19(4) (2023) - [c16]Andrej Dudenhefner, Christoph Stahl, Constantin Chaumet, Felix Laarmann, Jakob Rehof:
Finite Combinatory Logic with Predicates. TYPES 2023: 2:1-2:22 - 2022
- [c15]Andrej Dudenhefner
Constructive Many-One Reduction from the Halting Problem to Semi-Unification. CSL 2022: 18:1-18:19 - [c14]Andrej Dudenhefner
Certified Decision Procedures for Two-Counter Machines. FSCD 2022: 16:1-16:18 - [c13]Johannes Hostert
Undecidability of Dyadic First-Order Logic in Coq. ITP 2022: 19:1-19:19 - [i4]Andrej Dudenhefner:
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version). CoRR abs/2208.13428 (2022) - 2021
- [j5]Andrej Dudenhefner
Kripke Semantics for Intersection Formulas. ACM Trans. Comput. Log. 22(3): 15:1-15:16 (2021) - [c12]Andrej Dudenhefner
The Undecidability of System F Typability and Type Checking for Reductionists. LICS 2021: 1-10 - 2020
- [c11]Andrej Dudenhefner
Undecidability of Semi-Unification on a Napkin. FSCD 2020: 9:1-9:16
2010 – 2019
- 2019
- [b1]Andrej Dudenhefner:
Algorithmic aspects of type-based program sythesis. Technical University of Dortmund, Germany, 2019 - [j4]Andrej Dudenhefner
Undecidability of Intersection Type Inhabitation at Rank 3 and its Formalization. Fundam. Informaticae 170(1-3): 93-110 (2019) - [j3]Andrej Dudenhefner
Principality and approximation under dimensional bound. Proc. ACM Program. Lang. 3(POPL): 8:1-8:29 (2019) - 2018
- [j2]Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner
Mixin Composition Synthesis based on Intersection Types. Log. Methods Comput. Sci. 14(1) (2018) - [c10]Andrej Dudenhefner
A Simpler Undecidability Proof for System F Inhabitation. TYPES 2018: 2:1-2:11 - 2017
- [j1]Andrej Dudenhefner
The Algebraic Intersection Type Unification Problem. Log. Methods Comput. Sci. 13(3) (2017) - [c9]Andrej Dudenhefner
Typability in bounded dimension. LICS 2017: 1-12 - [c8]Andrej Dudenhefner
Intersection type calculi of bounded dimension. POPL 2017: 653-665 - [c7]Andrej Dudenhefner
The Complexity of Principal Inhabitation. FSCD 2017: 15:1-15:14 - [c6]Andrej Dudenhefner
Lower End of the Linial-Post Spectrum. TYPES 2017: 2:1-2:15 - [i3]Andrej Dudenhefner
Rank 3 Inhabitation of Intersection Types Revisited (Extended Version). CoRR abs/1705.06070 (2017) - [i2]Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder
Mixin Composition Synthesis based on Intersection Types. CoRR abs/1712.06906 (2017) - 2016
- [c5]Jan Bessai, Andrej Dudenhefner
Combinatory Process Synthesis. ISoLA (1) 2016: 266-281 - [c4]Andrej Dudenhefner
The Intersection Type Unification Problem. FSCD 2016: 19:1-19:16 - [i1]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. CoRR abs/1611.05672 (2016) - 2015
- [c3]Jan Bessai, Andrej Dudenhefner
Mixin Composition Synthesis Based on Intersection Types. TLCA 2015: 76-91 - 2014
- [c2]Jan Bessai, Andrej Dudenhefner
Combinatory Logic Synthesizer. ISoLA (1) 2014: 26-40 - [c1]Jan Bessai, Boris Düdder, Andrej Dudenhefner
Typing Classes and Mixins with Intersection Types. ITRS 2014: 79-93
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: