Ulrich Berger - RankMe

81 papers A* 2A 1B 8C 8Journal 48Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Uniform Realizability Interpretations. CoRR Ulrich Berger, Paulo Oliva
2024	J	`jnl`	Preface of the special issue for the conference computability in Europe 2022. Comput. Ulrich Berger, Johanna N. Y. Franklin, Elvira Mayordomo
2023	J	`jnl`	Computing with Infinite Objects: the Gray Code Case. Log. Methods Comput. Sci. Dieter Spreen, Ulrich Berger
2023	J	`jnl`	Concurrent Gaussian elimination. CoRR Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki
2023	J	`jnl`	Extracting total Amb programs from proofs. CoRR Ulrich Berger, Hideki Tsuiki
2022	A	`conf`	Extracting total Amb programs from proofs. ESOP Ulrich Berger, Hideki Tsuiki
2022	C	`ed.`	Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings CiE Ulrich Berger, Johanna N. Y. Franklin, Florin Manea, Arno Pauly
2021	J	`jnl`	Computing with Infinite Objects: the Gray Code Case. CoRR Dieter Spreen, Ulrich Berger
2021	J	`jnl`	Extracting total Amb programs from proofs. CoRR Ulrich Berger, Hideki Tsuiki
2021	J	`jnl`	Intuitionistic fixed point logic. Ann. Pure Appl. Log. Ulrich Berger, Hideki Tsuiki
2020	J	`jnl`	Intuitionistic Fixed Point Logic. CoRR Ulrich Berger, Hideki Tsuiki
2020	C	`conf`	Prawf: An Interactive Proof System for Program Extraction. CiE Ulrich Berger, Olga Petrovska, Hideki Tsuiki
2020	J	`jnl`	Report on BCTCS & AlgoUK 2020. Bull. EATCS Ulrich Berger, Faron Moller
2019	J	`jnl`	Program extraction applied to monadic parsing. J. Log. Comput. Ulrich Berger, Alison Jones, Monika Seisenberger
2018	—	`conf`	Martin Hofmann's Case for Non-Strictly Positive Data Types. TYPES Ulrich Berger, Ralph Matthes, Anton Setzer
2018	C	`conf`	Optimized Program Extraction for Induction and Coinduction. CiE Ulrich Berger, Olga Petrovska
2018	—	`conf`	Undecidability of Equality for Codata Types. CMCS Ulrich Berger, Anton Setzer
2018	J	`jnl`	Verification of the European Rail Traffic Management System in Real-Time Maude. Sci. Comput. Program. Ulrich Berger, Phillip James, Andrew Lawrence, Markus Roggenbach, Monika Seisenberger
2017	J	`jnl`	A realizability interpretation of Church's simple theory of types. Math. Struct. Comput. Sci. Ulrich Berger, Tie Hou
2017	J	`jnl`	Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler
2016	J	`jnl`	A coinductive approach to computing with compact sets. J. Log. Anal. Ulrich Berger, Dieter Spreen
2016	B	`conf`	Extracting Non-Deterministic Concurrent Programs. CSL Ulrich Berger
2015	J	`jnl`	A Coinductive Approach to Computing with Compact Sets. CoRR Ulrich Berger, Dieter Spreen
2015	J	`jnl`	Extracting verified decision procedures: DPLL and Resolution. Log. Methods Comput. Sci. Ulrich Berger, Andrew Lawrence, Fredrik Nordvall Forsberg, Monika Seisenberger
2015	J	`jnl`	Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2015	J	`jnl`	Preface. J. Log. Algebraic Methods Program. Ulrich Berger, Jens Blanck, Martín Escardó, Klaus Keimel
2014	C	`conf`	Uniform Schemata for Proof Rules. CiE Ulrich Berger, Tie Hou
2013	—	`conf`	Extracting Imperative Programs from Proofs: In-place Quicksort. TYPES Ulrich Berger, Monika Seisenberger, Gregory J. M. Woods
2013	J	`jnl`	Preface. Ann. Pure Appl. Log. Steffen van Bakel, Stefano Berardi, Ulrich Berger
2012	B	`conf`	Extracting a DPLL Algorithm. MFPS Andrew Lawrence, Ulrich Berger, Monika Seisenberger
2012	J	`jnl`	Foreword. Ann. Pure Appl. Log. Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen
2012	B	`conf`	Preface. MFPS Ulrich Berger, Michael W. Mislove
2012	B	`ed.`	Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2012, Bath, UK, June 6-9, 2012 MFPS Ulrich Berger, Michael W. Mislove
2012	J	`jnl`	Proofs, Programs, Processes. Theory Comput. Syst. Ulrich Berger, Monika Seisenberger
2012	B	`conf`	Typed vs. Untyped Realizability. MFPS Ulrich Berger, Tie Hou
2011	J	`jnl`	Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2011	J	`jnl`	From coinductive proofs to exact real arithmetic: theory and applications Log. Methods Comput. Sci. Ulrich Berger
2011	B	`conf`	Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger
2010	J	`jnl`	Domain representations of spaces of compact subsets. Math. Struct. Comput. Sci. Ulrich Berger, Jens Blanck, Petter Kristian Køber
2010	J	`jnl`	Preface. Ann. Pure Appl. Log. Steffen van Bakel, Stefano Berardi, Ulrich Berger
2010	—	`ed.`	Proceedings Third International Workshop on Classical Logic and Computation, CL&C 2010, Brno, Czech Republic, 21-22 August 2010. CL&C Steffen van Bakel, Stefano Berardi, Ulrich Berger
2010	C	`conf`	Proofs, Programs, Processes. CiE Ulrich Berger, Monika Seisenberger
2010	J	`jnl`	Realisability for Induction and Coinduction with Applications to Constructive Analysis. J. Univers. Comput. Sci. Ulrich Berger
2009	J	`jnl`	A coinductive approach to verified exact real number computation. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Ulrich Berger, Sion Lloyd
2009	B	`conf`	From Coinductive Proofs to Exact Real Arithmetic. CSL Ulrich Berger
2009	J	`jnl`	Proofs-as-Programs in Computable Analysis. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Ulrich Berger
2009	C	`conf`	Realisability and Adequacy for (Co)induction. CCA Ulrich Berger
2008	J	`jnl`	A Provably Correct Translation of the Theory Comput. Syst. Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer
2008	J	`jnl`	A domain model characterising strong normalisation. Ann. Pure Appl. Log. Ulrich Berger
2008	J	`jnl`	Classical truth in higher types. Math. Log. Q. Ulrich Berger
2008	J	`jnl`	Coinduction for Exact Real Number Computation. Theory Comput. Syst. Ulrich Berger, Tie Hou
2007	J	`jnl`	Continuous Lattices and Domains. Stud Logica Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, Dana S. Scott
2006	J	`jnl`	Continuous semantics for strong normalisation. Math. Struct. Comput. Sci. Ulrich Berger
2006	—	`conf`	Functional concepts in C++. Trends in Functional Programming Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer
2006	C	`ed.`	Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings CiE Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker
2006	J	`jnl`	Modified bar recursion. Math. Struct. Comput. Sci. Ulrich Berger, Paulo Oliva
2006	J	`jnl`	Program Extraction from Normalization Proofs. Stud Logica Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg
2005	B	`conf`	An Abstract Strong Normalization Theorem. CSL Ulrich Berger
2005	—	`ch.`	Applications of inductive definitions and choice principles to program synthesis. From sets and types to topology and analysis Ulrich Berger, Monika Seisenberger
2005	C	`conf`	Continuous Semantics for Strong Normalization. CiE Ulrich Berger
2005	—	`conf`	Continuous Semantics for Termination Proofs. Spatial Representation Ulrich Berger
2005	J	`jnl`	Strong normalisation for applied lambda calculi CoRR Ulrich Berger
2005	J	`jnl`	Strong normalization for applied lambda calculi. Log. Methods Comput. Sci. Ulrich Berger
2005	J	`jnl`	Uniform Heyting arithmetic. Ann. Pure Appl. Log. Ulrich Berger
2004	A*	`conf`	A Computational Interpretation of Open Induction. LICS Ulrich Berger
2004	J	`jnl`	An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
2003	J	`jnl`	Term rewriting for normalization by evaluation. Inf. Comput. Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
2002	J	`jnl`	Computability and Totality in Domains. Math. Struct. Comput. Sci. Ulrich Berger
2002	J	`jnl`	Refined program extraction form classical proofs. Ann. Pure Appl. Log. Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg
2001	J	`jnl`	Preface. Theor. Comput. Sci. Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
2001	—	`conf`	Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon Proof Theory in Computer Science Ulrich Berger
2001	J	`jnl`	The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reason. Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
1999	J	`jnl`	Density Theorems for the Domains-with-Totality Semantics of Dependent Types. Appl. Categorical Struct. Ulrich Berger
1999	—	`conf`	Effectivity and Density in Domains: A Survey. Realizability Semantics and Applications@FLoC Ulrich Berger
1998	—	`conf`	Normalisation by Evaluation. Prospects for Hardware Foundations Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
1995	—	`conf`	The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES Ulrich Berger, Helmut Schwichtenberg
1994	—	`conf`	Program Extraction from Classical Proofs. LCC Ulrich Berger, Helmut Schwichtenberg
1993	—	`conf`	Program Extraction from Normalization Proofs. TLCA Ulrich Berger
1993	J	`jnl`	Total Sets and Objects in Domain Theory. Ann. Pure Appl. Log. Ulrich Berger
1991	A*	`conf`	An Inverse of the Evaluation Functional for Typed lambda-calculus LICS Ulrich Berger, Helmut Schwichtenberg
1991	—	`conf`	Calculating a Garbage Collector. Methods of Programming Ulrich Berger, Werner Meixner, Bernhard Möller