Ulrich Berger

According to our database, Ulrich Berger authored at least 68 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Computing with Infinite Objects: the Gray Code Case.

Dieter Spreen, Ulrich Berger

Log. Methods Comput. Sci., 2023

Concurrent Gaussian elimination.

Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki

CoRR, 2023

2022

Extracting total Amb programs from proofs.

Ulrich Berger, Hideki Tsuiki

Proceedings of the Programming Languages and Systems, 2022

2021

Intuitionistic fixed point logic.

Ulrich Berger, Hideki Tsuiki

Ann. Pure Appl. Log., 2021

2020

Report on BCTCS & AlgoUK 2020.

Ulrich Berger, Faron Moller

Bull. EATCS, 2020

Prawf: An Interactive Proof System for Program Extraction.

Ulrich Berger, Olga Petrovska, Hideki Tsuiki

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Program extraction applied to monadic parsing.

Ulrich Berger, Alison Jones, Monika Seisenberger

J. Log. Comput., 2019

2018

Verification of the European Rail Traffic Management System in Real-Time Maude.

Ulrich Berger, Phillip James, Andrew Lawrence, Markus Roggenbach, Monika Seisenberger

Sci. Comput. Program., 2018

Martin Hofmann's Case for Non-Strictly Positive Data Types.

Ulrich Berger, Ralph Matthes, Anton Setzer

Proceedings of the 24th International Conference on Types for Proofs and Programs, 2018

Undecidability of Equality for Codata Types.

Ulrich Berger, Anton Setzer

Proceedings of the Coalgebraic Methods in Computer Science, 2018

Optimized Program Extraction for Induction and Coinduction.

Ulrich Berger, Olga Petrovska

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

A realizability interpretation of Church's simple theory of types.

Ulrich Berger, Tie Hou

Math. Struct. Comput. Sci., 2017

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).

Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler

J. Log. Anal., 2017

2016

A coinductive approach to computing with compact sets.

Ulrich Berger, Dieter Spreen

J. Log. Anal., 2016

Extracting Non-Deterministic Concurrent Programs.

Ulrich Berger

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Preface to the special issue: Computing with infinite data: topological and logical foundations.

Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki

Math. Struct. Comput. Sci., 2015

Preface.

Ulrich Berger, Jens Blanck, Martín Escardó, Klaus Keimel

J. Log. Algebraic Methods Program., 2015

Extracting verified decision procedures: DPLL and Resolution.

Ulrich Berger, Andrew Lawrence, Fredrik Nordvall Forsberg, Monika Seisenberger

Log. Methods Comput. Sci., 2015

2014

Uniform Schemata for Proof Rules.

Ulrich Berger, Tie Hou

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Extracting Imperative Programs from Proofs: In-place Quicksort.

Ulrich Berger, Monika Seisenberger, Gregory J. M. Woods

Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

2012

Proofs, Programs, Processes.

Ulrich Berger, Monika Seisenberger

Theory Comput. Syst., 2012

Extracting a DPLL Algorithm.

Andrew Lawrence, Ulrich Berger, Monika Seisenberger

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Preface.

Ulrich Berger, Michael W. Mislove

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Typed vs. Untyped Realizability.

Ulrich Berger, Tie Hou

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Foreword.

Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen

Ann. Pure Appl. Log., 2012

2011

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).

Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki

Dagstuhl Reports, 2011

From coinductive proofs to exact real arithmetic: theory and applications

Ulrich Berger

Log. Methods Comput. Sci., 2011

Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras.

Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010

Domain representations of spaces of compact subsets.

Ulrich Berger, Jens Blanck, Petter Kristian Køber

Math. Struct. Comput. Sci., 2010

Realisability for Induction and Coinduction with Applications to Constructive Analysis.

Ulrich Berger

J. Univers. Comput. Sci., 2010

Preface.

Steffen van Bakel, Stefano Berardi, Ulrich Berger

Ann. Pure Appl. Log., 2010

2009

A coinductive approach to verified exact real number computation.

Ulrich Berger, Sion Lloyd

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Proofs-as-Programs in Computable Analysis.

Ulrich Berger

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

From Coinductive Proofs to Exact Real Arithmetic.

Ulrich Berger

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Realisability and Adequacy for (Co)induction.

Ulrich Berger

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

A Provably Correct Translation of the <i>lambda</i> -Calculus into a Mathematical Model of C++.

Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer

Theory Comput. Syst., 2008

Coinduction for Exact Real Number Computation.

Ulrich Berger, Tie Hou

Theory Comput. Syst., 2008

Classical truth in higher types.

Ulrich Berger

Math. Log. Q., 2008

A domain model characterising strong normalisation.

Ulrich Berger

Ann. Pure Appl. Log., 2008

2007

Continuous Lattices and Domains.

Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, Dana S. Scott

Stud Logica, 2007

2006

Program Extraction from Normalization Proofs.

Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg

Stud Logica, 2006

Modified bar recursion.

Ulrich Berger, Paulo Oliva

Math. Struct. Comput. Sci., 2006

Continuous semantics for strong normalisation.

Ulrich Berger

Math. Struct. Comput. Sci., 2006

Functional concepts in C++.

Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer

Proceedings of the Revised Selected Papers from the Seventh Symposium on Trends in Functional Programming, 2006

2005

Strong normalization for applied lambda calculi.

Ulrich Berger

Log. Methods Comput. Sci., 2005

Strong normalisation for applied lambda calculi

Ulrich Berger

CoRR, 2005

Uniform Heyting arithmetic.

Ulrich Berger

Ann. Pure Appl. Log., 2005

Continuous Semantics for Termination Proofs.

Ulrich Berger

Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

An Abstract Strong Normalization Theorem.

Ulrich Berger

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Continuous Semantics for Strong Normalization.

Ulrich Berger

Proceedings of the New Computational Paradigms, 2005

Applications of inductive definitions and choice principles to program synthesis.

Ulrich Berger, Monika Seisenberger

Proceedings of the From sets and types to topology and analysis, 2005

2004

An arithmetic for non-size-increasing polynomial-time computation.

Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg

Theor. Comput. Sci., 2004

A Computational Interpretation of Open Induction.

Ulrich Berger

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

Term rewriting for normalization by evaluation.

Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg

Inf. Comput., 2003

2002

Computability and Totality in Domains.

Ulrich Berger

Math. Struct. Comput. Sci., 2002

Refined program extraction form classical proofs.

Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg

Ann. Pure Appl. Log., 2002

2001

Preface.

Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus

Theor. Comput. Sci., 2001

The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction.

Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger

J. Autom. Reason., 2001

Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon₀.

Ulrich Berger

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

1999

Effectivity and Density in Domains: A Survey.

Ulrich Berger

Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30, 1999

Density Theorems for the Domains-with-Totality Semantics of Dependent Types.

Ulrich Berger

Appl. Categorical Struct., 1999

1998

Normalisation by Evaluation.

Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg

Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1995

The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs.

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Types for Proofs and Programs, 1995

1994

Program Extraction from Classical Proofs.

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1993

Total Sets and Objects in Domain Theory.

Ulrich Berger

Ann. Pure Appl. Log., 1993

Program Extraction from Normalization Proofs.

Ulrich Berger

Proceedings of the Typed Lambda Calculi and Applications, 1993

1991

An Inverse of the Evaluation Functional for Typed lambda-calculus

Ulrich Berger, Helmut Schwichtenberg

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Calculating a Garbage Collector.

Ulrich Berger, Werner Meixner, Bernhard Möller

Proceedings of the Method of Programming, Selected Papers on the CIP-Project, 1991