Ulrich Berger

From MaRDI portal
Person:234584

Available identifiers

zbMath Open berger.ulrichMaRDI QIDQ234584

List of research outcomes





PublicationDate of PublicationType
Program extraction from classical proofs2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q61357682023-08-26Paper
On the Computational Content of Choice Principles2023-08-11Paper
Concurrent Gaussian Elimination2023-08-04Paper
Extracting total Amb programs from proofs2023-08-03Paper
\textsc{Prawf}: an interactive proof system for program extraction2022-12-16Paper
Martin Hofmann's Case for Non-Strictly Positive Data Types2022-07-21Paper
Intuitionistic fixed point logic2021-01-25Paper
Logic for Gray-code Computation2020-04-03Paper
Program extraction applied to monadic parsing2019-07-29Paper
The greatest common divisor: A case study for program extraction from classical proofs2019-01-15Paper
Undecidability of equality for codata types2018-10-23Paper
Optimized program extraction for induction and coinduction2018-09-06Paper
A realizability interpretation of Church's simple theory of types2017-11-22Paper
A coinductive approach to computing with compact sets2017-04-10Paper
Extracting Imperative Programs from Proofs: In-place Quicksort2017-03-13Paper
Typed vs. Untyped Realizability2016-07-08Paper
Extracting a DPLL Algorithm2016-07-08Paper
Extracting verified decision procedures: DPLL and Resolution2015-03-11Paper
Uniform Schemata for Proof Rules2015-02-25Paper
Proofs, programs, processes2012-12-07Paper
Realisability and adequacy for (co)induction2012-09-28Paper
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras2011-09-02Paper
From coinductive proofs to exact real arithmetic: theory and applications2011-05-26Paper
https://portal.mardi4nfdi.de/entity/Q30816402011-03-09Paper
https://portal.mardi4nfdi.de/entity/Q30752132011-02-10Paper
Proofs, Programs, Processes2010-07-29Paper
Domain representations of spaces of compact subsets2010-05-17Paper
From Coinductive Proofs to Exact Real Arithmetic2009-11-12Paper
Coinduction for exact real number computation2009-05-08Paper
A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++2009-05-08Paper
A domain model characterising strong normalisation2008-12-05Paper
Classical truth in higher types2008-06-12Paper
Strong normalisation for applied lambda calculi2007-10-11Paper
Continuous semantics for strong normalisation2007-02-09Paper
Computer Science Logic2006-11-01Paper
Modified bar recursion2006-08-10Paper
Program extraction from normalization proofs2006-03-17Paper
https://portal.mardi4nfdi.de/entity/Q57185672006-01-16Paper
New Computational Paradigms2006-01-11Paper
https://portal.mardi4nfdi.de/entity/Q57026622005-11-02Paper
Uniform Heyting arithmetic2005-04-21Paper
An arithmetic for non-size-increasing polynomial-time computation2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44360272003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q44287002003-09-22Paper
Term rewriting for normalization by evaluation.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q45247662003-07-29Paper
Computability and totality in domains2002-10-31Paper
Refined program extraction from classical proofs2002-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44991492001-03-06Paper
The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q49385502000-02-23Paper
Density theorems for the domains-with-totality semantics of dependent types1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q56872331997-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48832801996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48425321995-09-26Paper
https://portal.mardi4nfdi.de/entity/Q42814671994-05-15Paper
Total sets and objects in domain theory1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q33601721990-01-01Paper

Research outcomes over time

This page was built for person: Ulrich Berger