Andrej Bauer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrej Bauer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Philipp G. Haselwarter
Aarhus University, Aarhus, Denmark
2 shared publications - Anja Petković
Faculty of Mathematics and Physics Faculty of Mathematics and Physics University of Ljubljana University of Ljubljana
1 shared publication - Danel Ahman
University of Tartu, Tartu, Estonia
1 shared publication - Gauvain Devillez
University of Mons
1 shared publication - Jure Taslak
University of Ljubljana
1 shared publication - Katja Berčič
University of Ljubljana
1 shared publication
Latest Publications
- 5 June 2025
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 146
Comodule representations of second-order functionals
- 5 June 2025
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 146
Comodule representations of second-order functionals
- Open Access
- 12 February 2025
- Published by Journal of Logic and Analysis in Journal of Logic and Analysis
- Vol. 17
Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem
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.
- 12 February 2025
- Published by Journal of Logic and Analysis in Journal of Logic and Analysis
- Vol. 17
Open AccessSpreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem
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.
- 29 July 2024
- Published by Springer Nature
- p. 146-162
Incorporating a Database of Graphs into a Proof Assistant
- 29 July 2024
- Published by Springer Nature
- p. 146-162
Incorporating a Database of Graphs into a Proof Assistant
- Open Access
- 7 October 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 67 (4) , 1-87
Finitary Type Theories With and Without Contexts
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.
- 7 October 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 67 (4) , 1-87
Open AccessFinitary Type Theories With and Without Contexts
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.
- Open Access
- 8 July 2020
- Published by Springer Nature
- p. 253-259
Equality Checking for General Type Theories in Andromeda 2
- 8 July 2020
- Published by Springer Nature
- p. 253-259
Open AccessEquality Checking for General Type Theories in Andromeda 2
- Open Access
Programming with Algebraic Effects and Handlers
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.
Open AccessProgramming with Algebraic Effects and Handlers
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.