Vitenskapelig artikkel

• Marc Bezem; Thierry Coquand; Peter Dybjer et al. (2026). A Generalized Algebraic Theory for Type Theory with Explicit Universe Polymorphism. (ekstern lenke)
• Robin Adams; Marcus Aloysius Bezem; Thierry Coquand (2016). A Strongly Normalizing Computation Rule for Univalence in Higher-Order Minimal Logic. (ekstern lenke)
• Michal Walicki; Marcus Aloysius Bezem; Wojciech Szajnkenig (2009). Developing bounded reasoning. (ekstern lenke)
• Marc Bezem; Thierry Coquand; Peter Dybjer et al. (2023). Type Theory with Explicit Universe Polymorphism. (ekstern lenke)
• Marc Bezem; Thierry Coquand; Peter Dybjer et al. (2020). A Note on Generalized Algebraic Theories and Categories with Families. (ekstern lenke)
• Marcus Aloysius Bezem (2005). On the Undecidability of Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand (2003). Newman's Lemma -- a Case Study in Proof Automation and Geometric Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Dimitri Hendriks; Hans de Nivelle (2003). Automated Proof Construction in Type Theory Using Resolution. (ekstern lenke)
• Marcus Aloysius Bezem; Anh Hoang Truong (2005). Finding Resource Bounds in the Presence of Explicit Deallocation. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand (2005). Automating Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Dimitri Hendriks (2008). On the mechanization of the proof of Hessenberg's theorem in coherent logic. (ekstern lenke)
• Marcus A. Bezem; Dag Hovland; Anh Hoang Truong (2012). A type system for counting instances of software components. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand (2019). Skolem’s Theorem in Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Clemens Grabmayer; Michal Walicki (2012). Expressive power of digraph solvability. (ekstern lenke)
• Marcus A. Bezem; Tarmo Uustalu; Keiko Nakata (2012). On streams that are finitely red. (ekstern lenke)
• Marcus Aloysius Bezem; Anh Hoang Truong (2004). A type system for the safe instantiation of components. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand; Simon Huber (2014). A Model of Type Theory in Cubical Sets. (ekstern lenke)
• Sana Stojanovic; Julien Narboux; Marcus Aloysius Bezem et al. (2014). A vernacular for coherent logic. (ekstern lenke)
• Roberto Asin; Marcus Aloysius Bezem; Robert Nieuwenhuis (2015). Improving IntSat by expressing disjunctions of bounds as linear constraints. (ekstern lenke)
• Robin Adams; Marcus Aloysius Bezem; Thierry Coquand (2018). A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand; Keiko Nakata et al. (2018). Realizability at Work: Separating Two Constructive Notions of Finiteness. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand; Erik Parmann (2015). Non-constructivity in kan simplicial sets. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand (2015). A Kripke model for simplicial sets. (ekstern lenke)
• Marcus Aloysius Bezem; Robert Nieuwenhuis; Enric Rodriguez-Carbonell (2008). Exponential behaviour of the Butkovič–Zimmermann algorithm for solving two-sided linear systems in max-algebra. (ekstern lenke)
• Marcus Aloysius Bezem; Robert Nieuwenhuis; Enric Rodriguez-Carbonell (2008). The Max-Atom Problem and Its Relevance. (ekstern lenke)
• Marcus Aloysius Bezem (2010). Euclid's Lemma Revisited. (ekstern lenke)
• Keiko Nakata; Tarmo Uustalu; Marcus Aloysius Bezem (2011). A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. (ekstern lenke)
• Marcus Aloysius Bezem; Ulrik Buchholtz; Thierry Coquand (2018). Syntactic forcing models for coherent logic. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand; Simon Huber (2018). The univalence axiom in cubical sets. (ekstern lenke)
• Marcus Aloysius Bezem; Christian Sloper; Tore Langholm (2004). Black Box and White Box Identification of Formal Languages Using Test Sets. (ekstern lenke)
• Marcus Aloysius Bezem; John, R. Fisher (2007). Query Completeness of Skolem Machine computations. (ekstern lenke)
• Marcus Aloysius Bezem; Tore Langholm; Michal Walicki (2007). Completeness and Decidability in Sequence Logic. (ekstern lenke)
• Marcus Aloysius Bezem; John R. Fisher (2007). Skolem Machines and Geometric Logic. (ekstern lenke)
• Marc Bezem; Thierry Coquand; Peter Dybjer et al. (2021). On generalized algebraic theories and categories with families. (ekstern lenke)
• Marcus Aloysius Bezem; Robert Nieuwenhuis; Enric Rodriguez-Carbonell (2010). Hard problems in max-algebra, control theory, hypergraphs and other areas. (ekstern lenke)
• Marc Bezem; Thierry Coquand (2022). Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism. (ekstern lenke)
• Marc Bezem; Ulrik Buchholtz; Daniel R. Grayson et al. (2021). Construction of the circle in UniMath. (ekstern lenke)
• Marcus Aloysius Bezem; Ulrik Buchholtz; Thierry Coquand (2017). Syntactic Forcing Models for Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand; Simon Huber (2017). The univalence axiom in cubical sets. (ekstern lenke)
• John Fisher; Marcus Aloysius Bezem (2009). Skolem Machines. (ekstern lenke)

Konferanseforedrag

• Marcus Aloysius Bezem (2016). "Elements of Mathematics" in the Digital Age. (ekstern lenke)
• Michal Walicki; Marcus Aloysius Bezem; Tore Langholm (2007). Sekvenslogikk. (ekstern lenke)
• Marcus Aloysius Bezem (2016). A taxonomy of mathematical mistakes. (ekstern lenke)
• Marcus Aloysius Bezem (2016). Coherent Logic – an overview. (ekstern lenke)
• Marcus Aloysius Bezem; Anh Hoang Truong (2004). Counting instances of software components. (ekstern lenke)
• Marcus Aloysius Bezem (2008). The Max-Atom Problem and Hypergraphs. (ekstern lenke)
• Marcus Aloysius Bezem (2008). The Max-Atom Problem. (ekstern lenke)
• Marcus Aloysius Bezem (2018). The Univalence Axiom in Dependent Type Theory. (ekstern lenke)
• Marcus Aloysius Bezem (2011). A Hard Problem in Max-Algebra, Control Theory, Hypergraphs and Other Areas. (ekstern lenke)
• Marcus Aloysius Bezem (2002). Hoapata programs are monotonic. (ekstern lenke)
• Marcus Aloysius Bezem (2002). An improved extensionality criterion for higher-order logic programs. (ekstern lenke)
• Marcus Aloysius Bezem (2002). Automating the proof of Newman's Lemma. (ekstern lenke)
• Marcus Aloysius Bezem (2011). Bar Recursion. (ekstern lenke)
• Marcus Aloysius Bezem (2011). Constructive Finiteness. (ekstern lenke)
• Marcus Aloysius Bezem (2002). Automating the proof of Newman's Lemma. (ekstern lenke)
• Marcus Aloysius Bezem (2014). Coherent Logic and Applications. (ekstern lenke)
• Marcus Aloysius Bezem (2014). Homotopy Type Theory I. (ekstern lenke)
• Marcus Aloysius Bezem (2014). Homotopy Type Theory II. (ekstern lenke)
• Marcus Aloysius Bezem; K.R.A. Apt (2001). Formulas as Programs. (ekstern lenke)
• Marcus Aloysius Bezem (2009). Automating Coherent Logic - an overview. (ekstern lenke)
• Marcus Aloysius Bezem (2009). Existence of Shortest Paths in Hypergraphs and other Hard Problems. (ekstern lenke)
• Marcus Aloysius Bezem (2001). Type Theory. (ekstern lenke)
• Marcus Aloysius Bezem (2001). An improved extensionality criterion for higher-order logic programs. (ekstern lenke)
• Marcus Aloysius Bezem (2001). An improved extensionality criterion for higher-order logic programs. (ekstern lenke)
• Marcus Aloysius Bezem; Michal Walicki (2006). Decidability and Completeness of Sequence Logic. (ekstern lenke)
• Marcus Aloysius Bezem (2006). Propositional SAT - the search for a model of a given proposition. (ekstern lenke)
• Marcus Aloysius Bezem (2006). Theory and Practice of Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem (2011). A set that is streamless but not provably Noetherian. (ekstern lenke)
• Marcus Aloysius Bezem (2011). A set that is streamless but not provably Noetherian. (ekstern lenke)
• Marcus Aloysius Bezem (2012). A set that is streamless but not provably Noetherian. (ekstern lenke)
• Marcus Aloysius Bezem (2006). On the mechanization of the proof of Hessenberg's Theorem. (ekstern lenke)
• Marcus Aloysius Bezem (2013). "Elements of Mathematics" in the Digital Age. (ekstern lenke)
• Marcus Aloysius Bezem (2013). pplex - A Tool for Teaching the Simplex Method. (ekstern lenke)
• Marcus Aloysius Bezem (2008). Automating Coherent Logic. (ekstern lenke)
• Marcus Aloysius Bezem; John R. Fisher (2007). Query Completeness of Skolem Machine Computations. (ekstern lenke)
• Marcus Aloysius Bezem; Tore Langholm; Michal Walicki (2007). Completeness and Decidability in Sequence Logic. (ekstern lenke)
• Marcus Aloysius Bezem (2005). Disproving Distributivity in Lattices Using Geometric Logic. (ekstern lenke)
• Marcus Aloysius Bezem; Huong Anh Truong (2003). A Type System for the Safe Instantiation of Components. (ekstern lenke)
• Marcus Aloysius Bezem (2003). Newman's Lemma -- a case study in proof automation and geometric logic. (ekstern lenke)
• Marcus Aloysius Bezem; Huong Anh Truong (2003). A Type System for the Safe Instantiation of Components. (ekstern lenke)
• Marcus A. Bezem (2012). Elements of Mathematics in the Digital Age. (ekstern lenke)
• Marcus Aloysius Bezem (2008). The Max-Atom Problem and its Relevance. (ekstern lenke)

Forelesning

• Robin Adams; Marcus Aloysius Bezem; Thierry Coquand (2016). A Strongly Normalizing Computation Rule for the Univalence Axiom in Higher-Order Propositional Logic. (ekstern lenke)
• Marcus Aloysius Bezem (2018). Homotopy Type Theory and Univalent Foundations. (ekstern lenke)

Arbeidsnotat

• Marcus Aloysius Bezem (2001). The Curry-Howard-De Bruijn Correspondence "Propositions as Types". (ekstern lenke)

Doktorgradsavhandling

• Eivind Jahren; Marcus Aloysius Bezem (2018). Three exact methods for some problems in Combinatorial Optimization. (ekstern lenke)
• Erik Parmann; Marcus Aloysius Bezem (2016). Case Studies in Constructive Mathematics. (ekstern lenke)

Vitenskapelig bokkapittel

• Michal Walicki; Marc Bezem; Wojciech Szajnkenig (2006). A strongly complete logic of dense time intervals. (ekstern lenke)
• Pierre Cagne; Ulrik Torben Buchholz; Nicolai Kraus et al. (2024). On symmetries of spheres in univalent foundations. (ekstern lenke)
• Marcus A. Bezem (2013). Platek's system Y: fixed point recursion. (ekstern lenke)
• Bård Henning Tvedt; Marcus A. Bezem (2012). Towards automated scheduling in the oil industry: modeling safety constraints. (ekstern lenke)
• Marc Bezem (2003). Mathematical Background. (ekstern lenke)
• Marcus Aloysius Bezem; Thierry Coquand (2004). Newman's Lemma -- a Case Study in Proof Automation and Geometric Logic. (ekstern lenke)
• Marc Bezem; Jan Willem Klop; Vincent van Oostrom (2003). Advanced ARS theory. (ekstern lenke)
• Marc Bezem; Jan Willem Klop (2003). Abstract reduction systems. (ekstern lenke)
• Marcus Aloysius Bezem; Dimitri Hendriks (2006). On the mechanization of Hessenberg's Theorem. (ekstern lenke)
• Marcus A. Bezem (2013). Gödel's system T: higher-order primitive recursion. (ekstern lenke)
• Marcus A. Bezem (2013). Spector's system B: bar recursion. (ekstern lenke)
• Marcus Aloysius Bezem; Robert Nieuwenhuis (2016). Completeness of Cutting Planes Revisited. (ekstern lenke)

Antologi

• Marc Bezem; Assia Mahboubi (2020). 25th International Conference on Types for Proofs and Programs (TYPES 2019). (ekstern lenke)
• Marc Bezem; Jan Willem Klop; Roel de Vrijer (2003). Term rewriting systems : Terese. (ekstern lenke)

Masteroppgave

• Eva Burrows; Marcus Aloysius Bezem (2003). Formulas as programs. (ekstern lenke)

Forskningsrapport

• Steve Awodey; Marcus A. Bezem; Thierry Coquand et al. (2013). Homotopy Type Theory (www.homotopytypetheory.org/book). (ekstern lenke)
• Marcus Aloysius Bezem; Wolfgang Ahrendt; Hans De Nivelle et al. (2005). Disproving Distributivity in Lattices Using Geometric Logic. (ekstern lenke)
• Michal Anton S Walicki; Marcus Aloysius Bezem; Clemens Grabmayer (2010). Expressive power of digraph solvability. (ekstern lenke)
• Marcus Aloysius Bezem; Niels Van der Weide (2019). Book of Abstracts of TYPES 2019. (ekstern lenke)

Tidsskriftomtale

• Marcus Aloysius Bezem (2006). Book review of F.~Kamareddine, T.~Laan and R.~Nederpelt, "A Modern Perspective on Type Theory - From its Origins until Today" Applied Logic Series 29, Kluwer Academic Publishers. (ekstern lenke)

Se en fullstendig oversikt over publikasjoner i NVA.