| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4685318 | 2018-10-05 | Paper |
| About the range property for \(\mathcal H\) | 2014-01-22 | Paper |
| Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus | 2013-10-02 | Paper |
| Asymptotically almost all \lambda-terms are strongly normalizing | 2013-04-09 | Paper |
| Strong normalization results by translation | 2011-08-26 | Paper |
| A short proof that adding some permutation rules to \(\beta \) preserves SN | 2011-03-14 | Paper |
| A direct proof of the confluence of combinatory strong reduction | 2009-10-09 | Paper |
| A short proof of the strong normalization of the simply typed $\lambda\mu$-calculus | 2009-05-11 | Paper |
| Counting proofs in propositional logic | 2009-04-27 | Paper |
| An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types | 2009-03-10 | Paper |
| Arithmetical proofs of strong normalization results for symmetric lambda calculi | 2007-07-20 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Typed Lambda Calculi and Applications | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657053 | 2005-03-14 | Paper |
| A short proof of the strong normalization of classical natural deduction with disjunction | 2005-02-09 | Paper |
| Discrete, Continuous, and Hybrid Petri Nets | 2004-11-18 | Paper |
| An experiment concerning mathematical proofs on computers with French undergraduate students | 2004-10-28 | Paper |
| On hybrid Petri nets | 2001-09-18 | Paper |
| Normalization without reducibility | 2001-07-24 | Paper |
| A \(\lambda\)-calculus with explicit weakening and explicit substitution | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263864 | 2000-02-28 | Paper |
| A syntactical proof of the operational equivalence of two \(\lambda\)-terms | 1998-07-22 | Paper |
| Storage operators and directed lambda-calculus | 1996-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850465 | 1995-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4844951 | 1995-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4289139 | 1994-04-28 | Paper |
| Petri nets for modeling of dynamic systems -- a survey | 1994-03-13 | Paper |
| Asymptotic continuous Petri nets | 1993-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4004136 | 1992-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750699 | 1990-01-01 | Paper |
| Approximate analysis of transfer lines with unreliable machines and finite buffers | 1989-01-01 | Paper |
| Signature Analysis for Multiple-Output Circuits | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680825 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218113 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3660930 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663155 | 1983-01-01 | Paper |
| A very absolute Π21 real singleton | 1982-01-01 | Paper |
| Δ31 reals | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3932638 | 1981-01-01 | Paper |
| Testing by Feedback Shift Register | 1980-01-01 | Paper |
| Minimal Detecting Transition Sequences: Application to Random Testing | 1980-01-01 | Paper |
| A result of relative consistency about the predicate WO(δ, x) | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3872444 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4187741 | 1979-01-01 | Paper |
| A \(\pi^1_2\) singleton with no sharp in a generic extension of \(L^\#\) | 1978-01-01 | Paper |
| A Totally Self-Checking 1-Out-of-3 Checker | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4158965 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194876 | 1978-01-01 | Paper |
| Modular Design of Asynchronous Circuits Defined by Graphs | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146682 | 1977-01-01 | Paper |
| About Random Fault Detection of Combinational Networks | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4097281 | 1975-01-01 | Paper |
