Marc Bezem

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 15

Top Topics

Linear Constraints

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Pierre Cagne, Ulrik Torben Buchholtz, Nicolai Kraus, Marc Bezem
On symmetries of spheres in univalent foundations. LICS (2024)
Pierre Cagne, Ulrik Buchholtz, Nicolai Kraus, Marc Bezem
On symmetries of spheres in univalent foundations. CoRR (2024)
Marc Bezem, Thierry Coquand
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism. Theor. Comput. Sci. 913 (2022)
Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó
Type Theories with Universe Level Judgements. CoRR (2022)
Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó
Type Theory with Explicit Universe Polymorphism. TYPES (2022)
Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó
On generalized algebraic theories and categories with families. Math. Struct. Comput. Sci. 31 (9) (2021)
Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó
A Note on Generalized Algebraic Theories and Categories with Families. CoRR (2020)
Marc Bezem, Ulrik Buchholtz, Daniel R. Grayson
Construction of the Circle in UniMath. CoRR (2019)
Marc Bezem, Thierry Coquand
Skolem's Theorem in Coherent Logic. Fundam. Informaticae 170 (1-3) (2019)
Marc Bezem, Thierry Coquand, Simon Huber
The Univalence Axiom in Cubical Sets. J. Autom. Reason. 63 (2) (2019)
Marc Bezem, Thierry Coquand, Simon Huber
The univalence axiom in cubical sets. CoRR (2017)
Robin Adams, Marc Bezem, Thierry Coquand
A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic. TYPES (2016)
Marc Bezem, Thierry Coquand, Keiko Nakata, Erik Parmann
Realizability at Work: Separating Two Constructive Notions of Finiteness. TYPES (2016)
Robin Adams, Marc Bezem, Thierry Coquand
A Strongly Normalizing Computation Rule for Univalence in Higher-Order Minimal Logic. CoRR (2016)
Roberto Asín, Marc Bezem, Robert Nieuwenhuis
Improving IntSat by expressing disjunctions of bounds as linear constraints. AI Commun. 29 (1) (2016)
Marc Bezem, Thierry Coquand
A Kripke model for simplicial sets. Theor. Comput. Sci. 574 (2015)
Marc Bezem, Thierry Coquand, Erik Parmann
Non-Constructivity in Kan Simplicial Sets. TLCA (2015)
Sana Stojanovic, Julien Narboux, Marc Bezem, Predrag Janicic
A Vernacular for Coherent Logic. CoRR (2014)
Sana Stojanovic, Julien Narboux, Marc Bezem, Predrag Janicic
A Vernacular for Coherent Logic. CICM (2014)
Marc Bezem, Thierry Coquand, Simon Huber
A Model of Type Theory in Cubical Sets. TYPES (2013)
Marc Bezem, Clemens Grabmayer, Michal Walicki
Expressive power of digraph solvability. Ann. Pure Appl. Log. 163 (3) (2012)
Marc Bezem, Dag Hovland, Hoang Truong
A type system for counting instances of software components. Theor. Comput. Sci. 458 (2012)
Marc Bezem, Keiko Nakata, Tarmo Uustalu
On streams that are finitely red Log. Methods Comput. Sci. 8 (4) (2012)
Keiko Nakata, Tarmo Uustalu, Marc Bezem
A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS (2011)
Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell
Hard problems in max-algebra, control theory, hypergraphs and other areas. Inf. Process. Lett. 110 (4) (2010)
Michal Walicki, Marc Bezem, Wojtek Szajnkenig
Developing Bounded Reasoning. J. Log. Lang. Inf. 18 (1) (2009)
John Fisher, Marc Bezem
Skolem Machines. Fundam. Informaticae 91 (1) (2009)
Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell
Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra. Discret. Appl. Math. 156 (18) (2008)
Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell
The Max-Atom Problem and Its Relevance. LPAR (2008)
Marc Bezem, Dimitri Hendriks
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic. J. Autom. Reason. 40 (1) (2008)
Marc Bezem, Tore Langholm, Michal Walicki
Completeness and Decidability in Sequence Logic. LPAR (2007)
John Fisher, Marc Bezem
Skolem Machines and Geometric Logic. ICTAC (2007)
John Fisher, Marc Bezem
Query Completeness of Skolem Machine Computations. MCU (2007)
Hoang Truong, Marc Bezem
Finding Resource Bounds in the Presence of Explicit Deallocation. ICTAC (2005)
Marc Bezem, Thierry Coquand
Automating Coherent Logic. LPAR (2005)
Marc Bezem
On the Undecidability of Coherent Logic. Processes, Terms and Cycles (2005)
Marc Bezem, Hoang Truong
A Type System for the Safe Instantiation of Components. Electron. Notes Theor. Comput. Sci. 97 (2004)
Marc Bezem, Christian Sloper, Tore Langholm
Black Box and White Box Identification of Formal Languages Using Test Sets. Grammars 7 (2004)
Marc Bezem, Thierry Coquand
Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column. Bull. EATCS 79 (2003)
Tore Langholm, Marc Bezem
A Descriptive Characterisation of Even Linear Languages. Grammars 6 (3) (2003)
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
Automated Proof Construction in Type Theory Using Resolution. J. Autom. Reason. 29 (3-4) (2002)
Marc Bezem
An Improved Extensionality Criterion for Higher-Order Logic Programs. CSL (2001)
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
Automated Proof Construction in Type Theory Using Resolution. CADE (2000)
Marc Bezem
Extensionality of Simply Typed Logic Programs. ICLP (1999)
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
Diagram Techniques for Confluence. Inf. Comput. 141 (2) (1998)
Stefano Berardi, Marc Bezem, Thierry Coquand
On the Computational Content of the Axiom of Choice. J. Symb. Log. 63 (2) (1998)
Krzysztof R. Apt, Marc Bezem
Formulas as Programs CoRR (1998)
Marc Bezem, Alban Ponse
Two Finite Specifications of a Queue. Theor. Comput. Sci. 177 (2) (1997)
Marc Bezem, Roland N. Bol, Jan Friso Groote
Formalizing Process Algebraic Verifications in the Calculus of Constructions. Formal Aspects Comput. 9 (1) (1997)
Erik Barendsen, Marc Bezem
Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization. Ann. Pure Appl. Log. 79 (3) (1996)
Marc Bezem, Jan Springintveld
. J. Funct. Program. 6 (5) (1996)
Stefano Berardi, Marc Bezem, Thierry Coquand
A realization of the negative interpretation of the Axiom of Choice. TLCA (1995)
Marc Bezem, Jan Friso Groote
Invariants in Process Algebra with Data. CONCUR (1994)
Marc Bezem, Jan Keuzenkamp
Undecidable Goals for Completed Acyclic Programs. New Gener. Comput. 12 (2) (1994)
Marc Bezem, Jan Friso Groote
A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL. Comput. J. 37 (4) (1994)
Marc Bezem
Strong Termination of Logic Programs. J. Log. Program. 15 (1&2) (1993)
Krzysztof R. Apt, Marc Bezem
Acyclic Programs. New Gener. Comput. 9 (3/4) (1991)
Marc Bezem
Semantics and Consistency of Rule-Based Expert Systems. J. Log. Comput. 1 (4) (1991)
Krzysztof R. Apt, Marc Bezem
Acyclic Programs. ICLP (1990)
Marc Bezem
Completeness of Resolution Revisited. Theor. Comput. Sci. 74 (2) (1990)
Marc Bezem
Compact and Majorizable Functionals of Finite Type. J. Symb. Log. 54 (1) (1989)
Marc Bezem
Characterizing Termination of Logic Programs with Level Mappings. NACLP (1989)
Marc Bezem
Consistency of Rule-based Expert System. CADE (1988)
Marc Bezem, Jan van Leeuwen
On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26 (6) (1988)
Marc Bezem
Equivalence of bar recursors in the theory of functionals of finite type. Arch. Math. Log. 27 (2) (1988)
Marc Bezem
Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. J. Symb. Log. 50 (3) (1985)
Marc Bezem
Isomorphisms Between HEO and HROE, ECF and ICFE. J. Symb. Log. 50 (2) (1985)
Marc Bezem
Strong normalization of barrecursive terms without using infinite terms. Arch. Math. Log. 25 (1) (1985)