Andrej Bauer

Andrej Bauer

Auto-generated profile, based on publicly available information

Andrej Bauer

University of Ljubljana

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 October 2023 in Journal of Automated Reasoning
Verified
Journal Article
Open access
PDF file
PHPhilipp G. Haselwarter
Philipp G. Haselwarter
ABAndrej Bauer
Andrej Bauer
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin–Löf type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We prove several general meta-theorems about finitary type theories: weakening, admissibility of substitution and instantiation of metavariables, derivability of presuppositions, uniqueness of typing, and inversion principles. We then give a second formulation of finitary type theories in which there are no explicit contexts. Instead, free variables are explicitly annotated with their types. We provide translations between finitary type theories with and without contexts, thereby showing that they have the same expressive power. The context-free type theory is implemented in the nucleus of the Andromeda 2 proof assistant.

12 February 2025 in Journal of Logic and Analysis
Verified
Journal Article
Open access
PDF file
ABAndrej Bauer
Andrej Bauer
I take a constructive look at Dieter Spreen's treatment of effective topological spaces and the Kreisel-Lacombe-Shoenfield-Tseitin (KLST) continuity theorem. Transferring Spreen's ideas from classical computability theory and numbered sets to a constructive setting leads to a theory of topological spaces, in fact two of them: a locale-theoretic one embodied by the notion of σ-frames, and a pointwise one that follows more closely traditional topology. Spreen's notion of effective limit passing turns out to be closely related to sobriety, while his witnesses for non-inclusion give rise to a novel separation property – any point separated from an overt subset by a semidecidable subset is already separated from it by an open one. I name spaces with this property Spreen spaces, and show that they give rise to a purely constructive continuity theorem: every map from an overt Spreen space to a pointwise regular space is pointwise continuous. The theorem is easily proved, but finding non-trivial examples of Spreen spaces is harder. I show that they are plentiful in synthetic computability theory.

8 July 2020
Verified
Book Chapter
Open access
PDF file
ABAndrej Bauer
Andrej Bauer
PHPhilipp G. Haselwarter
Philipp G. Haselwarter
APAnja Petković
Anja Petković
We designed a user-extensible judgemental equality checking algorithm for general type theories that supports computation rules and extensionality rules. The user needs only provide the equality rules they wish to use, after which the algorithm devises an appropriate notion of normal form. The algorithm is a generalization of type-directed equality checking for Martin-Löf type theory, and we implemented it in the Andromeda 2 prover.

29 July 2024
Verified
Book Chapter
Closed access
PDF file
ABAndrej Bauer
Andrej Bauer
KBKatja Berčič
Katja Berčič
GDGauvain Devillez
Gauvain Devillez
JTJure Taslak
Jure Taslak

5 June 2025 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Closed access
DADanel Ahman
Danel Ahman
ABAndrej Bauer
Andrej Bauer

7 March 2012 in arXiv
Verified
Preprint
Open access
PDF file
ABAndrej Bauer
Andrej Bauer
MPMatija Pretnar
Matija Pretnar
Eff is a programming language based on the algebraic approach to computational effects, in which effects are viewed as algebraic operations and effect handlers as homomorphisms from free algebras. Eff supports first-class effects and handlers through which we may easily define new computational effects, seamlessly combine existing ones, and handle them in novel ways. We give a denotational semantics of eff and discuss a prototype implementation based on it. Through examples we demonstrate how the standard effects are treated in eff, and how eff supports programming techniques that use various forms of delimited continuations, such as backtracking, breadth-first search, selection functionals, cooperative multi-threading, and others.