| 2006 |
| 16 | EE | Will Harwood,
Faron Moller,
Anton Setzer:
Weak Bisimulation Approximants.
CSL 2006: 365-379 |
| 15 | EE | Anton Setzer:
Partial Recursive Functions in Martin-Löf Type Theory.
CiE 2006: 505-515 |
| 14 | | Rose H. Abdul Rauf,
Ulrich Berger,
Anton Setzer:
Functional concepts in C++.
Trends in Functional Programming 2006: 163-179 |
| 13 | | Anton Setzer:
Object-oriented programming in dependent type theory.
Trends in Functional Programming 2006: 91-108 |
| 12 | EE | Peter Dybjer,
Anton Setzer:
Indexed induction-recursion.
J. Log. Algebr. Program. 66(1): 1-49 (2006) |
| 2005 |
| 11 | EE | Markus Michelbrink,
Anton Setzer:
State Dependent IO-Monads in Type Theory.
Electr. Notes Theor. Comput. Sci. 122: 127-146 (2005) |
| 2003 |
| 10 | EE | Peter Dybjer,
Anton Setzer:
Induction-recursion and initial algebras.
Ann. Pure Appl. Logic 124(1-3): 1-47 (2003) |
| 2002 |
| 9 | EE | Anton Setzer:
Java as a Functional Programming Language.
TYPES 2002: 279-298 |
| 2001 |
| 8 | EE | Peter Dybjer,
Anton Setzer:
Indexed Induction-Recursion.
Proof Theory in Computer Science 2001: 93-113 |
| 2000 |
| 7 | EE | Peter Hancock,
Anton Setzer:
Interactive Programs in Dependent Type Theory.
CSL 2000: 317-331 |
| 6 | EE | Anton Setzer:
Extending Martin-Löf Type Theory by one Mahlo-universe.
Arch. Math. Log. 39(3): 155-181 (2000) |
| 1999 |
| 5 | EE | Peter Dybjer,
Anton Setzer:
A Finite Axiomatization of Inductive-Recursive Definitions.
TLCA 1999: 129-146 |
| 4 | | Gerhard Jäger,
Reinhard Kahle,
Anton Setzer,
Thomas Strahm:
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log. 64(1): 53-67 (1999) |
| 1998 |
| 3 | | Anton Setzer:
Well-Ordering, Proofs for Martin-Löf Type Theory.
Ann. Pure Appl. Logic 92(2): 113-159 (1998) |
| 1997 |
| 2 | | Anton Setzer:
Translating Set Theoretical Proofs into Type Theoretical Programs.
Kurt Gödel Colloquium 1997: 278-289 |
| 1996 |
| 1 | | Anton Setzer:
Inductive Definitions with Decidable Atomic Formulas.
CSL 1996: 414-430 |