| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Martin Hofmann's Case for Non-Strictly Positive Data Types | Berger, Ulrich et al. | 2019 |
| 2 | Extracting Non-Deterministic Concurrent Programs | Berger, Ulrich | 2016 |
| 3 | Extracting Imperative Programs from Proofs: In-place Quicksort | Berger, Ulrich et al. | 2014 |
| 4 | Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411) | Berger, Ulrich et al. | 2012 |
| 5 | Realisability and Adequacy for (Co)induction | Berger, Ulrich | 2009 |
| 6 | Continuous Semantics for Termination Proofs | Berger, Ulrich | 2005 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |