Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarUlrich Berger 0001
Person information
- affiliation: Swansea University, UK
Other persons with the same name
- Ulrich Berger
- Ulrich Berger 0002
![[0000-0001-9002-6877]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9002-6877")
— Brandenburg University of Technology, Cottbus-Senftenberg, Germany - Ulrich Berger 0003 — Vienna University of Economics and Business, Wien, Austria
- Ulrich Berger 0004 — Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j39]Ulrich Berger, Alison Jones, Monika Seisenberger:
Program extraction applied to monadic parsing. J. Log. Comput. 29(4): 487-518 (2019)- 2018
- [j38]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: 61-88 (2018) - 2017
- [j37]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. Logic & Analysis 9 (2017) - [j36]Ulrich Berger, Tie Hou:
A realizability interpretation of Church's simple theory of types. Mathematical Structures in Computer Science 27(8): 1364-1385 (2017) - 2016
- [j35]Ulrich Berger, Dieter Spreen:
A coinductive approach to computing with compact sets. J. Logic & Analysis 8 (2016) - 2015
- [j34]Ulrich Berger, Andrew Lawrence, Fredrik Nordvall Forsberg, Monika Seisenberger:
Extracting verified decision procedures: DPLL and Resolution. Logical Methods in Computer Science 11(1) (2015) - [j33]Ulrich Berger, Jens Blanck, Martín Escardó, Klaus Keimel:
Preface. J. Log. Algebr. Meth. Program. 84(1): 107 (2015) - [j32]Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki:
Preface to the special issue: Computing with infinite data: topological and logical foundations. Mathematical Structures in Computer Science 25(7): 1463-1465 (2015) - 2013
- [j31]Steffen van Bakel, Stefano Berardi, Ulrich Berger:
Preface. Ann. Pure Appl. Logic 164(6): 589-590 (2013) - 2012
- [j30]Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen:
Foreword. Ann. Pure Appl. Logic 163(8): 973-974 (2012) - [j29]Ulrich Berger, Michael W. Mislove:
Preface. Electr. Notes Theor. Comput. Sci. 286: 1-2 (2012) - [j28]Ulrich Berger, Tie Hou:
Typed vs. Untyped Realizability. Electr. Notes Theor. Comput. Sci. 286: 57-71 (2012) - [j27]Andrew Lawrence, Ulrich Berger, Monika Seisenberger:
Extracting a DPLL Algorithm. Electr. Notes Theor. Comput. Sci. 286: 243-256 (2012) - [j26]Ulrich Berger, Monika Seisenberger:
Proofs, Programs, Processes. Theory Comput. Syst. 51(3): 313-329 (2012) - 2011
- [j25]Ulrich Berger:
From coinductive proofs to exact real arithmetic: theory and applications. Logical Methods in Computer Science 7(1) (2011) - 2010
- [j24]Steffen van Bakel, Stefano Berardi, Ulrich Berger:
Preface. Ann. Pure Appl. Logic 161(11): 1313-1314 (2010) - [j23]Ulrich Berger:
Realisability for Induction and Coinduction with Applications to Constructive Analysis. J. UCS 16(18): 2535-2555 (2010) - [j22]Ulrich Berger, Jens Blanck, Petter Kristian Køber:
Domain representations of spaces of compact subsets. Mathematical Structures in Computer Science 20(2): 107-126 (2010) - 2009
- [j21]Ulrich Berger:
Proofs-as-Programs in Computable Analysis. ECEASST 23 (2009) - [j20]Ulrich Berger, Sion Lloyd:
A coinductive approach to verified exact real number computation. ECEASST 23 (2009) - 2008
- [j19]Ulrich Berger:
A domain model characterising strong normalisation. Ann. Pure Appl. Logic 156(1): 39-50 (2008) - [j18]Ulrich Berger:
Classical truth in higher types. Math. Log. Q. 54(3): 240-246 (2008) - [j17]Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer:
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. Theory Comput. Syst. 43(3-4): 298-321 (2008) - [j16]Ulrich Berger, Tie Hou:
Coinduction for Exact Real Number Computation. Theory Comput. Syst. 43(3-4): 394-409 (2008) - 2007
- [j15]Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, D. S. Scott:
Continuous Lattices and Domains. Studia Logica 86(1): 137-138 (2007) - 2006
- [j14]Ulrich Berger, Paulo Oliva:
Modified bar recursion. Mathematical Structures in Computer Science 16(2): 163-183 (2006) - [j13]Ulrich Berger:
Continuous semantics for strong normalisation. Mathematical Structures in Computer Science 16(5): 751-762 (2006) - [j12]Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg:
Program Extraction from Normalization Proofs. Studia Logica 82(1): 25-49 (2006) - 2005
- [j11]Ulrich Berger:
Uniform Heyting arithmetic. Ann. Pure Appl. Logic 133(1-3): 125-148 (2005) - [j10]Ulrich Berger:
Strong normalization for applied lambda calculi. Logical Methods in Computer Science 1(2) (2005) - 2004
- [j9]Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg:
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004) - 2003
- [j8]Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg:
Term rewriting for normalization by evaluation. Inf. Comput. 183(1): 19-42 (2003) - 2002
- [j7]Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg:
Refined program extraction form classical proofs. Ann. Pure Appl. Logic 114(1-3): 3-25 (2002) - [j6]Ulrich Berger:
Computability and Totality in Domains. Mathematical Structures in Computer Science 12(3): 281-294 (2002) - 2001
- [j5]Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger:
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reasoning 26(2): 205-221 (2001) - [j4]Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus:
Preface. Theor. Comput. Sci. 264(2): 169 (2001) - 1999
- [j3]Ulrich Berger:
Density Theorems for the Domains-with-Totality Semantics of Dependent Types. Applied Categorical Structures 7(1-2): 3-30 (1999) - [j2]Ulrich Berger:
Effectivity and Density in Domains: A Survey. Electr. Notes Theor. Comput. Sci. 23(1): 27-39 (1999) - 1993
- [j1]Ulrich Berger:
Total Sets and Objects in Domain Theory. Ann. Pure Appl. Logic 60(2): 91-117 (1993)
Conference and Workshop Papers
- 2018
- [c21]Ulrich Berger, Olga Petrovska:
Optimized Program Extraction for Induction and Coinduction. CiE 2018: 70-80 - [c20]Ulrich Berger, Anton Setzer:
Undecidability of Equality for Codata Types. CMCS 2018: 34-55 - [c19]Ulrich Berger, Ralph Matthes, Anton Setzer:
Martin Hofmann's Case for Non-Strictly Positive Data Types. TYPES 2018: 1:1-1:22 - 2016
- [c18]Ulrich Berger:
Extracting Non-Deterministic Concurrent Programs. CSL 2016: 26:1-26:21 - 2014
- [c17]Ulrich Berger, Tie Hou:
Uniform Schemata for Proof Rules. CiE 2014: 53-62 - 2013
- [c16]Ulrich Berger, Monika Seisenberger, Gregory J. M. Woods:
Extracting Imperative Programs from Proofs: In-place Quicksort. TYPES 2013: 84-106 - 2011
- [c15]Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger:
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO 2011: 393-399 - 2010
- [c14]Ulrich Berger, Monika Seisenberger:
Proofs, Programs, Processes. CiE 2010: 39-48 - 2009
- [c13]Ulrich Berger:
Realisability and Adequacy for (Co)induction. CCA 2009 - [c12]Ulrich Berger:
From Coinductive Proofs to Exact Real Arithmetic. CSL 2009: 132-146 - 2006
- [c11]Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer:
Functional concepts in C++. Trends in Functional Programming 2006: 163-179 - 2005
- [c10]Ulrich Berger:
Continuous Semantics for Strong Normalization. CiE 2005: 23-34 - [c9]Ulrich Berger:
An Abstract Strong Normalization Theorem. CSL 2005: 27-35 - 2004
- [c8]Ulrich Berger:
A Computational Interpretation of Open Induction. LICS 2004: 326 - 2001
- [c7]Ulrich Berger:
Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0. Proof Theory in Computer Science 2001: 68-77 - 1998
- [c6]Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg:
Normalisation by Evaluation. Prospects for Hardware Foundations 1998: 117-137 - 1995
- [c5]Ulrich Berger, Helmut Schwichtenberg:
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES 1995: 36-46 - 1994
- [c4]Ulrich Berger, Helmut Schwichtenberg:
Program Extraction from Classical Proofs. LCC 1994: 77-97 - 1993
- [c3]Ulrich Berger:
Program Extraction from Normalization Proofs. TLCA 1993: 91-106 - 1991
- [c2]Ulrich Berger, Werner Meixner, Bernhard Möller:
Calculating a Garbage Collector. Methods of Programming 1991: 137-192 - [c1]Ulrich Berger, Helmut Schwichtenberg:
An Inverse of the Evaluation Functional for Typed lambda-calculus. LICS 1991: 203-211
Editorship
- 2010
- [e2]Steffen van Bakel, Stefano Berardi, Ulrich Berger:
Proceedings Third International Workshop on Classical Logic and Computation, CL&C 2010, Brno, Czech Republic, 21-22 August 2010. EPTCS 47, 2010 [contents] - 2006
- [e1]Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker:
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Lecture Notes in Computer Science 3988, Springer 2006, ISBN 3-540-35466-2 [contents]
Informal and Other Publications
- 2015
- [i4]Ulrich Berger, Dieter Spreen:
A Coinductive Approach to Computing with Compact Sets. CoRR abs/1510.08498 (2015) - 2011
- [i3]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): 14-36 (2011) - 2005
- [i2]Ulrich Berger:
Continuous Semantics for Termination Proofs. Spatial Representation 2005 - [i1]Ulrich Berger:
Strong normalisation for applied lambda calculi. CoRR abs/cs/0507007 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-12-05 23:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
