Ulrich Berger

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 23

Top Topics

Logical Foundations

Concurrent Programs

Multivariate Gaussian Distribution

Top Venues

Math. Struct. Comput. Sci.

Publications

Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki
Concurrent Gaussian elimination. CoRR (2023)
Dieter Spreen, Ulrich Berger
Computing with Infinite Objects: the Gray Code Case. Log. Methods Comput. Sci. 19 (3) (2023)
Ulrich Berger, Hideki Tsuiki
Extracting total Amb programs from proofs. CoRR (2023)
Ulrich Berger, Hideki Tsuiki
Extracting total Amb programs from proofs. ESOP (2022)
Dieter Spreen, Ulrich Berger
Computing with Infinite Objects: the Gray Code Case. CoRR (2021)
Ulrich Berger, Hideki Tsuiki
Extracting total Amb programs from proofs. CoRR (2021)
Ulrich Berger, Hideki Tsuiki
Intuitionistic fixed point logic. Ann. Pure Appl. Log. 172 (3) (2021)
Ulrich Berger, Hideki Tsuiki
Intuitionistic Fixed Point Logic. CoRR (2020)
Ulrich Berger, Olga Petrovska, Hideki Tsuiki
Prawf: An Interactive Proof System for Program Extraction. CiE (2020)
Ulrich Berger, Faron Moller
Report on BCTCS & AlgoUK 2020. Bull. EATCS 131 (2020)
Ulrich Berger, Alison Jones, Monika Seisenberger
Program extraction applied to monadic parsing. J. Log. Comput. 29 (4) (2019)
Ulrich Berger, Anton Setzer
Undecidability of Equality for Codata Types. CMCS (2018)
Ulrich Berger, Olga Petrovska
Optimized Program Extraction for Induction and Coinduction. CiE (2018)
Ulrich Berger, Ralph Matthes, Anton Setzer
Martin Hofmann's Case for Non-Strictly Positive Data Types. TYPES (2018)
Ulrich Berger, Phillip James, Andrew Lawrence, Markus Roggenbach, Monika Seisenberger
Verification of the European Rail Traffic Management System in Real-Time Maude. Sci. Comput. Program. 154 (2018)
Ulrich Berger, Tie Hou
A realizability interpretation of Church's simple theory of types. Math. Struct. Comput. Sci. 27 (8) (2017)
Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler
Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. 9 (2017)
Ulrich Berger, Dieter Spreen
A coinductive approach to computing with compact sets. J. Log. Anal. 8 (2016)
Ulrich Berger
Extracting Non-Deterministic Concurrent Programs. CSL (2016)
Ulrich Berger, Dieter Spreen
A Coinductive Approach to Computing with Compact Sets. CoRR (2015)
Ulrich Berger, Andrew Lawrence, Fredrik Nordvall Forsberg, Monika Seisenberger
Extracting verified decision procedures: DPLL and Resolution. Log. Methods Comput. Sci. 11 (1) (2015)
Ulrich Berger, Jens Blanck, Martín Escardó, Klaus Keimel
Preface. J. Log. Algebraic Methods Program. 84 (1) (2015)
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. 25 (7) (2015)
Ulrich Berger, Tie Hou
Uniform Schemata for Proof Rules. CiE (2014)
Ulrich Berger, Monika Seisenberger, Gregory J. M. Woods
Extracting Imperative Programs from Proofs: In-place Quicksort. TYPES (2013)
Steffen van Bakel, Stefano Berardi, Ulrich Berger
Preface. Ann. Pure Appl. Log. 164 (6) (2013)
Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen
Foreword. Ann. Pure Appl. Log. 163 (8) (2012)
Andrew Lawrence, Ulrich Berger, Monika Seisenberger
Extracting a DPLL Algorithm. MFPS (2012)
Ulrich Berger, Tie Hou
Typed vs. Untyped Realizability. MFPS (2012)
Ulrich Berger, Monika Seisenberger
Proofs, Programs, Processes. Theory Comput. Syst. 51 (3) (2012)
Ulrich Berger, Michael W. Mislove
Preface. MFPS (2012)
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports 1 (10) (2011)
Ulrich Berger
From coinductive proofs to exact real arithmetic: theory and applications Log. Methods Comput. Sci. 7 (1) (2011)
Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO (2011)
Ulrich Berger, Monika Seisenberger
Proofs, Programs, Processes. CiE (2010)
Ulrich Berger
Realisability for Induction and Coinduction with Applications to Constructive Analysis. J. Univers. Comput. Sci. 16 (18) (2010)
Ulrich Berger, Jens Blanck, Petter Kristian Køber
Domain representations of spaces of compact subsets. Math. Struct. Comput. Sci. 20 (2) (2010)
Steffen van Bakel, Stefano Berardi, Ulrich Berger
Preface. Ann. Pure Appl. Log. 161 (11) (2010)
Ulrich Berger, Sion Lloyd
A coinductive approach to verified exact real number computation. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009)
Ulrich Berger
Realisability and Adequacy for (Co)induction. CCA (2009)
Ulrich Berger
Proofs-as-Programs in Computable Analysis. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009)
Ulrich Berger
From Coinductive Proofs to Exact Real Arithmetic. CSL (2009)
Ulrich Berger, Tie Hou
Coinduction for Exact Real Number Computation. Theory Comput. Syst. 43 (3-4) (2008)
Ulrich Berger
Classical truth in higher types. Math. Log. Q. 54 (3) (2008)
Ulrich Berger
A domain model characterising strong normalisation. Ann. Pure Appl. Log. 156 (1) (2008)
Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer
-Calculus into a Mathematical Model of C++. Theory Comput. Syst. 43 (3-4) (2008)
Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, Dana S. Scott
Continuous Lattices and Domains. Stud Logica 86 (1) (2007)
Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer
Functional concepts in C++. Trends in Functional Programming (2006)
Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg
Program Extraction from Normalization Proofs. Stud Logica 82 (1) (2006)
Ulrich Berger
Continuous semantics for strong normalisation. Math. Struct. Comput. Sci. 16 (5) (2006)
Ulrich Berger, Paulo Oliva
Modified bar recursion. Math. Struct. Comput. Sci. 16 (2) (2006)
Ulrich Berger
Continuous Semantics for Termination Proofs. Spatial Representation (2005)
Ulrich Berger
Strong normalisation for applied lambda calculi CoRR (2005)
Ulrich Berger
Continuous Semantics for Strong Normalization. CiE (2005)
Ulrich Berger
Uniform Heyting arithmetic. Ann. Pure Appl. Log. 133 (1-3) (2005)
Ulrich Berger
An Abstract Strong Normalization Theorem. CSL (2005)
Ulrich Berger
Strong normalization for applied lambda calculi. Log. Methods Comput. Sci. 1 (2) (2005)
Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318 (1-2) (2004)
Ulrich Berger
A Computational Interpretation of Open Induction. LICS (2004)
Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
Term rewriting for normalization by evaluation. Inf. Comput. 183 (1) (2003)
Ulrich Berger
Computability and Totality in Domains. Math. Struct. Comput. Sci. 12 (3) (2002)
Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg
Refined program extraction form classical proofs. Ann. Pure Appl. Log. 114 (1-3) (2002)
Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
Preface. Theor. Comput. Sci. 264 (2) (2001)
Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reason. 26 (2) (2001)
Ulrich Berger
. Proof Theory in Computer Science (2001)
Ulrich Berger
Effectivity and Density in Domains: A Survey. Electron. Notes Theor. Comput. Sci. 23 (1) (1999)
Ulrich Berger
Density Theorems for the Domains-with-Totality Semantics of Dependent Types. Appl. Categorical Struct. 7 (1-2) (1999)
Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
Normalisation by Evaluation. Prospects for Hardware Foundations (1998)
Ulrich Berger, Helmut Schwichtenberg
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES (1995)
Ulrich Berger, Helmut Schwichtenberg
Program Extraction from Classical Proofs. LCC (1994)
Ulrich Berger
Total Sets and Objects in Domain Theory. Ann. Pure Appl. Log. 60 (2) (1993)
Ulrich Berger
Program Extraction from Normalization Proofs. TLCA (1993)
Ulrich Berger, Helmut Schwichtenberg
An Inverse of the Evaluation Functional for Typed lambda-calculus LICS (1991)
Ulrich Berger, Werner Meixner, Bernhard Möller
Calculating a Garbage Collector. Methods of Programming (1991)