Marc Bezem - RankMe

74 papers A* 1A 2B 10C 4Journal 45Unranked 9

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