| 2008 |
|---|
| 34 | EE | Ulrich Berger:
Classical truth in higher types.
Math. Log. Q. 54(3): 240-246 (2008) |
| 2007 |
|---|
| 33 | EE | Ulrich Berger:
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove and D. S. Scott, Continuous Lattices and Domains.
Studia Logica 86(1): 137-138 (2007) |
| 2006 |
|---|
| 32 | | 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
Springer 2006 |
| 31 | | Sven Thiebus,
Ulrich Berger,
Ralf Kretzschmann:
Knowledge Management for Ramp-Up - Approach for Knowledge Management for Ramp-Up in the Automotive Industry.
ICEIS (2) 2006: 323-330 |
| 30 | | Rose H. Abdul Rauf,
Ulrich Berger,
Anton Setzer:
Functional concepts in C++.
Trends in Functional Programming 2006: 163-179 |
| 29 | EE | Ulrich Berger,
Paulo Oliva:
Modified bar recursion.
Mathematical Structures in Computer Science 16(2): 163-183 (2006) |
| 28 | EE | Ulrich Berger:
Continuous semantics for strong normalisation.
Mathematical Structures in Computer Science 16(5): 751-762 (2006) |
| 27 | EE | Ulrich Berger,
Stefan Berghofer,
Pierre Letouzey,
Helmut Schwichtenberg:
Program Extraction from Normalization Proofs.
Studia Logica 82(1): 25-49 (2006) |
| 2005 |
|---|
| 26 | EE | Ulrich Berger:
An Abstract Strong Normalization Theorem.
CSL 2005: 27-35 |
| 25 | EE | Ulrich Berger:
Continuous Semantics for Strong Normalization.
CiE 2005: 23-34 |
| 24 | EE | Ulrich Berger,
Raffaello Lepratti,
M. May:
An approach for the automatic generation of robot paths from CAD-data.
ETFA 2005 |
| 23 | EE | Ulrich Berger:
Continuous Semantics for Termination Proofs.
Spatial Representation 2005 |
| 22 | EE | Ulrich Berger:
Uniform Heyting arithmetic.
Ann. Pure Appl. Logic 133(1-3): 125-148 (2005) |
| 21 | EE | Ulrich Berger:
Strong normalisation for applied lambda calculi
CoRR abs/cs/0507007: (2005) |
| 20 | EE | Ulrich Berger:
Strong normalization for applied lambda calculi.
Logical Methods in Computer Science 1(2): (2005) |
| 2004 |
|---|
| 19 | EE | Ulrich Berger:
A Computational Interpretation of Open Induction.
LICS 2004: 326 |
| 18 | | Raffaello Lepratti,
Ulrich Berger:
Enhancing Interoperability Through The Ontological Filtering System.
Virtual Enterprises and Collaborative Networks 2004: 183-190 |
| 17 | EE | 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 |
|---|
| 16 | | Raffaello Lepratti,
Ulrich Berger:
Towards Ontology Solutions For Enabling Interoperability In Virtual Enterprises.
PRO-VE 2003: 307-314 |
| 15 | | Michael Weyrich,
Jing Cai,
Ulrich Berger:
Standardization Of Machining Process Planning In Powertrain Production Using A CAD-Based IT-Tool.
PRO-VE 2003: 379-388 |
| 14 | EE | Ulrich Berger,
Matthias Eberl,
Helmut Schwichtenberg:
Term rewriting for normalization by evaluation.
Inf. Comput. 183(1): 19-42 (2003) |
| 2002 |
|---|
| 13 | | Ulrich Berger,
Wilfried Buchholz,
Helmut Schwichtenberg:
Refined program extraction form classical proofs.
Ann. Pure Appl. Logic 114(1-3): 3-25 (2002) |
| 12 | | Ulrich Berger:
Computability and Totality in Domains.
Mathematical Structures in Computer Science 12(3): 281-294 (2002) |
| 2001 |
|---|
| 11 | EE | Ulrich Berger:
Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0.
Proof Theory in Computer Science 2001: 68-77 |
| 10 | | 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) |
| 9 | EE | Ulrich Berger,
Karl-Heinz Niggl,
Bernhard Reus:
Preface.
Theor. Comput. Sci. 264(2): 169 (2001) |
| 1999 |
|---|
| 8 | EE | Ulrich Berger:
Effectivity and Density in Domains: A Survey.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 1998 |
|---|
| 7 | EE | Ulrich Berger,
Matthias Eberl,
Helmut Schwichtenberg:
Normalisation by Evaluation.
Prospects for Hardware Foundations 1998: 117-137 |
| 1995 |
|---|
| 6 | EE | Ulrich Berger,
Helmut Schwichtenberg:
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs.
TYPES 1995: 36-46 |
| 1994 |
|---|
| 5 | | Ulrich Berger,
Helmut Schwichtenberg:
Program Extraction from Classical Proofs.
LCC 1994: 77-97 |
| 1993 |
|---|
| 4 | | Ulrich Berger:
Program Extraction from Normalization Proofs.
TLCA 1993: 91-106 |
| 3 | | Ulrich Berger:
Total Sets and Objects in Domain Theory.
Ann. Pure Appl. Logic 60(2): 91-117 (1993) |
| 1991 |
|---|
| 2 | | Ulrich Berger,
Helmut Schwichtenberg:
An Inverse of the Evaluation Functional for Typed lambda-calculus
LICS 1991: 203-211 |
| 1 | | Ulrich Berger,
Werner Meixner,
Bernhard Möller:
Calculating a Garbage Collector.
Methods of Programming 1991: 137-192 |
