Andrej Bauer

Orcid: 0000-0001-5378-0547

Affiliations:
  • University of Ljubljana, Slovenia


According to our database1, Andrej Bauer authored at least 50 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Incorporating a Database of Graphs into a Proof Assistant.
Proceedings of the Intelligent Computer Mathematics - 17th International Conference, 2024

2023
Finitary Type Theories With and Without Contexts.
J. Autom. Reason., December, 2023

Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401).
Dagstuhl Reports, 2023

MLFMF: Data Sets for Machine Learning for Mathematical Formalization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
An extensible equality checking algorithm for dependent type theories.
Log. Methods Comput. Sci., 2022

Instance reducibility and Weihrauch degrees.
Log. Methods Comput. Sci., 2022

A global COVID-19 observatory, monitoring the pandemics through text mining and visualization.
Informatica (Slovenia), 2022

2020
A general definition of dependent type theories.
CoRR, 2020

Equality Checking for General Type Theories in Andromeda 2.
Proceedings of the Mathematical Software - ICMS 2020, 2020

Runners in Action.
Proceedings of the Programming Languages and Systems, 2020

2019
Every metric space is separable in function realizability.
Log. Methods Comput. Sci., 2019

2018
Formalization of Mathematics in Type Theory (Dagstuhl Seminar 18341).
Dagstuhl Reports, 2018

What is algebraic about algebraic effects and handlers?
CoRR, 2018

2017
Report on MFPS XXXIII and CALCO 2017.
ACM SIGLOG News, 2017

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).
J. Log. Anal., 2017

The HoTT library: a formalization of homotopy type theory in Coq.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
From Theory to Practice of Algebraic Effects and Handlers (Dagstuhl Seminar 16112).
Dagstuhl Reports, 2016

Design and Implementation of the Andromeda Proof Assistant.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

2015
An injection from the Baire space to natural numbers.
Math. Struct. Comput. Sci., 2015

Programming with algebraic effects and handlers.
J. Log. Algebraic Methods Program., 2015

2014
Cartesian closed categories of separable Scott domains.
Theor. Comput. Sci., 2014

An Effect System for Algebraic Effects and Handlers.
Log. Methods Comput. Sci., 2014

2013
On Monadic Parametricity of Second-Order Functionals.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
On the failure of fixed-point theorems for chain-complete lattices in the effective topos.
Theor. Comput. Sci., 2012

Similarity-Based Relations in Datalog Programs.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2012

Metric spaces in synthetic topology.
Ann. Pure Appl. Log., 2012

Preface.
Ann. Pure Appl. Log., 2012

2010
Computability and Complexity in Analysis.
J. Univers. Comput. Sci., 2010

Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions.
J. Univers. Comput. Sci., 2010

2009
The Dedekind reals in abstract Stone duality.
Math. Struct. Comput. Sci., 2009

RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice.
J. Log. Comput., 2009

Similarity Measures for Relational Databases.
Informatica (Slovenia), 2009

A constructive theory of continuous domains suitable for implementation.
Ann. Pure Appl. Log., 2009

CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Preface.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Sheaf toposes for realizability.
Arch. Math. Log., 2008

2007
Implementing Real Numbers With RZ.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2005
Specifications via Realizability.
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

First Steps in Synthetic Computability Theory.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Realizability as Connection between Constructive and Computable Mathematics.
Proceedings of the CCA 2005, 2005

2004
Equilogical spaces.
Theor. Comput. Sci., 2004

Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability.
Math. Log. Q., 2004

Propositions as Types.
J. Log. Comput., 2004

2002
Comparing Functional Paradigms for Exact Real-Number Computation.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
A Relationship between Equilogical Spaces and Type Two Effectivity.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

2000
Continuous Functionals of Dependent Types and Equilogical Spaces.
Proceedings of the Computer Science Logic, 2000

1999
Multibasic and Mixed Hypergeometric Gosper-Type Algorithms.
J. Symb. Comput., 1999

1998
Analytica - An Experiment in Combining Theorem Proving and Symbolic Computation.
J. Autom. Reason., 1998

Equilogical spaces and domains with totality.
Proceedings of the Workshop on Domains IV 1998, 1998


  Loading...