Marc Bezem

Orcid: 0000-0002-7320-1976

According to our database1, Marc Bezem authored at least 64 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On symmetries of spheres in univalent foundations.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2022
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism.
Theor. Comput. Sci., 2022

Type Theories with Universe Level Judgements.
CoRR, 2022

Type Theory with Explicit Universe Polymorphism.
Proceedings of the 28th International Conference on Types for Proofs and Programs, 2022

2021
On generalized algebraic theories and categories with families.
Math. Struct. Comput. Sci., 2021

2020
A Note on Generalized Algebraic Theories and Categories with Families.
CoRR, 2020

2019
The Univalence Axiom in Cubical Sets.
J. Autom. Reason., 2019

Skolem's Theorem in Coherent Logic.
Fundam. Informaticae, 2019

Construction of the Circle in UniMath.
CoRR, 2019

2016
A Strongly Normalizing Computation Rule for Univalence in Higher-Order Minimal Logic.
CoRR, 2016

Improving IntSat by expressing disjunctions of bounds as linear constraints.
AI Commun., 2016

Realizability at Work: Separating Two Constructive Notions of Finiteness.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

2015
A Kripke model for simplicial sets.
Theor. Comput. Sci., 2015

Non-Constructivity in Kan Simplicial Sets.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2014
A Vernacular for Coherent Logic.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

2013
A Model of Type Theory in Cubical Sets.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

2012
A type system for counting instances of software components.
Theor. Comput. Sci., 2012

On streams that are finitely red
Log. Methods Comput. Sci., 2012

Expressive power of digraph solvability.
Ann. Pure Appl. Log., 2012

2011
A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
Hard problems in max-algebra, control theory, hypergraphs and other areas.
Inf. Process. Lett., 2010

2009
Developing Bounded Reasoning.
J. Log. Lang. Inf., 2009

Skolem Machines.
Fundam. Informaticae, 2009

2008
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic.
J. Autom. Reason., 2008

Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra.
Discret. Appl. Math., 2008

The Max-Atom Problem and Its Relevance.
Proceedings of the Logic for Programming, 2008

2007
Query Completeness of Skolem Machine Computations.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Completeness and Decidability in Sequence Logic.
Proceedings of the Logic for Programming, 2007

Skolem Machines and Geometric Logic.
Proceedings of the Theoretical Aspects of Computing, 2007

2005
Automating Coherent Logic.
Proceedings of the Logic for Programming, 2005

Finding Resource Bounds in the Presence of Explicit Deallocation.
Proceedings of the Theoretical Aspects of Computing, 2005

On the Undecidability of Coherent Logic.
Proceedings of the Processes, 2005

2004
Black Box and White Box Identification of Formal Languages Using Test Sets.
Grammars, 2004

2003
A Descriptive Characterisation of Even Linear Languages.
Grammars, 2003

A Type System for the Safe Instantiation of Components.
Proceedings of FOCLASA 2003, 2003

Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column.
Bull. EATCS, 2003

2002
Automated Proof Construction in Type Theory Using Resolution.
J. Autom. Reason., 2002

2001
An Improved Extensionality Criterion for Higher-Order Logic Programs.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

1999
Extensionality of Simply Typed Logic Programs.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Formulas as Programs.
Proceedings of the Logic Programming Paradigm - A 25-Year Perspective, 1999

1998
On the Computational Content of the Axiom of Choice.
J. Symb. Log., 1998

Diagram Techniques for Confluence.
Inf. Comput., 1998

Formulas as Programs
CoRR, 1998

1997
Two Finite Specifications of a Queue.
Theor. Comput. Sci., 1997

Formalizing Process Algebraic Verifications in the Calculus of Constructions.
Formal Aspects Comput., 1997

1996
A Simple Proof of the Undecidability of Inhabitation in lambda<i>P</i>.
J. Funct. Program., 1996

Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization.
Ann. Pure Appl. Log., 1996

1995
A realization of the negative interpretation of the Axiom of Choice.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
Undecidable Goals for Completed Acyclic Programs.
New Gener. Comput., 1994

A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL.
Comput. J., 1994

Invariants in Process Algebra with Data.
Proceedings of the CONCUR '94, 1994

1993
Strong Termination of Logic Programs.
J. Log. Program., 1993

1991
Acyclic Programs.
New Gener. Comput., 1991

Semantics and Consistency of Rule-Based Expert Systems.
J. Log. Comput., 1991

1990
Completeness of Resolution Revisited.
Theor. Comput. Sci., 1990

1989
Compact and Majorizable Functionals of Finite Type.
J. Symb. Log., 1989

Characterizing Termination of Logic Programs with Level Mappings.
Proceedings of the Logic Programming, 1989

1988
On Estimating the Complexity of Logarithmic Decompositions.
Inf. Process. Lett., 1988

Equivalence of bar recursors in the theory of functionals of finite type.
Arch. Math. Log., 1988

Consistency of Rule-based Expert System.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1985
Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals.
J. Symb. Log., 1985

Isomorphisms Between HEO and HROE, ECF and ICFE.
J. Symb. Log., 1985

Strong normalization of barrecursive terms without using infinite terms.
Arch. Math. Log., 1985


  Loading...