default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Bezem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Pierre Cagne
, Ulrik Torben Buchholtz, Nicolai Kraus, Marc Bezem:
On symmetries of spheres in univalent foundations. LICS 2024: 20:1-20:14- [i8]Pierre Cagne, Ulrik Buchholtz, Nicolai Kraus, Marc Bezem:
On symmetries of spheres in univalent foundations. CoRR abs/2401.15037 (2024) - 2022
- [j36]Marc Bezem, Thierry Coquand:
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism. Theor. Comput. Sci. 913: 1-7 (2022) - [c23]Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó:
Type Theory with Explicit Universe Polymorphism. TYPES 2022: 13:1-13:16 - [i7]Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó:
Type Theories with Universe Level Judgements. CoRR abs/2212.03284 (2022) - 2021
- [j35]Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó:
On generalized algebraic theories and categories with families. Math. Struct. Comput. Sci. 31(9): 1006-1023 (2021) - 2020
- [e4]Marc Bezem, Assia Mahboubi:
25th International Conference on Types for Proofs and Programs, TYPES 2019, June 11-14, 2019, Oslo, Norway. LIPIcs 175, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-158-0 [contents] - [i6]Marc Bezem, Thierry Coquand, Peter Dybjer, Martín Escardó:
A Note on Generalized Algebraic Theories and Categories with Families. CoRR abs/2012.08370 (2020)
2010 – 2019
- 2019
- [j34]Marc Bezem, Thierry Coquand:
Skolem's Theorem in Coherent Logic. Fundam. Informaticae 170(1-3): 1-14 (2019) - [j33]Marc Bezem, Thierry Coquand, Simon Huber:
The Univalence Axiom in Cubical Sets. J. Autom. Reason. 63(2): 159-171 (2019) - [i5]Marc Bezem, Ulrik Buchholtz, Daniel R. Grayson:
Construction of the Circle in UniMath. CoRR abs/1910.01856 (2019) - 2017
- [i4]Marc Bezem, Thierry Coquand, Simon Huber:
The univalence axiom in cubical sets. CoRR abs/1710.10941 (2017) - 2016
- [j32]Roberto Asín, Marc Bezem, Robert Nieuwenhuis:
Improving IntSat by expressing disjunctions of bounds as linear constraints. AI Commun. 29(1): 205-209 (2016) - [c22]Robin Adams, Marc Bezem, Thierry Coquand:
A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic. TYPES 2016: 3:1-3:20 - [c21]Marc Bezem, Thierry Coquand, Keiko Nakata, Erik Parmann:
Realizability at Work: Separating Two Constructive Notions of Finiteness. TYPES 2016: 6:1-6:23 - [i3]Robin Adams, Marc Bezem, Thierry Coquand:
A Strongly Normalizing Computation Rule for Univalence in Higher-Order Minimal Logic. CoRR abs/1610.00026 (2016) - 2015
- [j31]Marc Bezem, Thierry Coquand:
A Kripke model for simplicial sets. Theor. Comput. Sci. 574: 86-91 (2015) - [c20]Marc Bezem, Thierry Coquand, Erik Parmann:
Non-Constructivity in Kan Simplicial Sets. TLCA 2015: 92-106 - 2014
- [c19]Sana Stojanovic, Julien Narboux, Marc Bezem, Predrag Janicic:
A Vernacular for Coherent Logic. CICM 2014: 388-403 - [i2]Sana Stojanovic, Julien Narboux, Marc Bezem, Predrag Janicic:
A Vernacular for Coherent Logic. CoRR abs/1405.3391 (2014) - 2013
- [c18]Marc Bezem, Thierry Coquand, Simon Huber:
A Model of Type Theory in Cubical Sets. TYPES 2013: 107-128 - 2012
- [j30]Marc Bezem, Clemens Grabmayer, Michal Walicki:
Expressive power of digraph solvability. Ann. Pure Appl. Log. 163(3): 200-213 (2012) - [j29]Marc Bezem, Keiko Nakata, Tarmo Uustalu:
On streams that are finitely red. Log. Methods Comput. Sci. 8(4) (2012) - [j28]Marc Bezem, Dag Hovland, Hoang Truong:
A type system for counting instances of software components. Theor. Comput. Sci. 458: 29-48 (2012) - 2011
- [c17]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: 353-368 - [e3]Marc Bezem:
Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings. LIPIcs 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2011, ISBN 978-3-939897-32-3 [contents] - 2010
- [j27]Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell:
Hard problems in max-algebra, control theory, hypergraphs and other areas. Inf. Process. Lett. 110(4): 133-138 (2010)
2000 – 2009
- 2009
- [j26]John Fisher, Marc Bezem:
Skolem Machines. Fundam. Informaticae 91(1): 79-103 (2009) - [j25]Michal Walicki, Marc Bezem, Wojtek Szajnkenig:
Developing Bounded Reasoning. J. Log. Lang. Inf. 18(1): 97-129 (2009) - 2008
- [j24]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): 3506-3509 (2008) - [j23]Marc Bezem, Dimitri Hendriks:
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic. J. Autom. Reason. 40(1): 61-85 (2008) - [c16]Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell:
The Max-Atom Problem and Its Relevance. LPAR 2008: 47-61 - 2007
- [c15]John Fisher, Marc Bezem:
Skolem Machines and Geometric Logic. ICTAC 2007: 201-215 - [c14]Marc Bezem, Tore Langholm, Michal Walicki:
Completeness and Decidability in Sequence Logic. LPAR 2007: 123-137 - [c13]John Fisher, Marc Bezem:
Query Completeness of Skolem Machine Computations. MCU 2007: 182-192 - 2005
- [c12]Marc Bezem:
On the Undecidability of Coherent Logic. Processes, Terms and Cycles 2005: 6-13 - [c11]Hoang Truong, Marc Bezem:
Finding Resource Bounds in the Presence of Explicit Deallocation. ICTAC 2005: 227-241 - [c10]Marc Bezem, Thierry Coquand:
Automating Coherent Logic. LPAR 2005: 246-260 - 2004
- [j22]Marc Bezem, Christian Sloper, Tore Langholm:
Black Box and White Box Identification of Formal Languages Using Test Sets. Grammars 7: 111-123 (2004) - 2003
- [j21]Marc Bezem, Thierry Coquand:
Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column. Bull. EATCS 79: 86-100 (2003) - [j20]Tore Langholm, Marc Bezem:
A Descriptive Characterisation of Even Linear Languages. Grammars 6(3): 169-181 (2003) - [c9]Marc Bezem, Hoang Truong:
A Type System for the Safe Instantiation of Components. FOCLASA 2003: 197-217 - 2002
- [j19]Marc Bezem, Dimitri Hendriks, Hans de Nivelle:
Automated Proof Construction in Type Theory Using Resolution. J. Autom. Reason. 29(3-4): 253-275 (2002) - 2001
- [c8]Marc Bezem:
An Improved Extensionality Criterion for Higher-Order Logic Programs. CSL 2001: 203-216 - 2000
- [c7]Marc Bezem, Dimitri Hendriks, Hans de Nivelle:
Automated Proof Construction in Type Theory Using Resolution. CADE 2000: 148-163
1990 – 1999
- 1999
- [c6]Marc Bezem:
Extensionality of Simply Typed Logic Programs. ICLP 1999: 395-410 - [p1]Krzysztof R. Apt, Marc Bezem:
Formulas as Programs. The Logic Programming Paradigm 1999: 75-107 - 1998
- [j18]Marc Bezem, Jan Willem Klop, Vincent van Oostrom:
Diagram Techniques for Confluence. Inf. Comput. 141(2): 172-204 (1998) - [j17]Stefano Berardi, Marc Bezem, Thierry Coquand:
On the Computational Content of the Axiom of Choice. J. Symb. Log. 63(2): 600-622 (1998) - [i1]Krzysztof R. Apt, Marc Bezem:
Formulas as Programs. CoRR cs.LO/9811017 (1998) - 1997
- [j16]Marc Bezem, Roland N. Bol, Jan Friso Groote:
Formalizing Process Algebraic Verifications in the Calculus of Constructions. Formal Aspects Comput. 9(1): 1-48 (1997) - [j15]Marc Bezem, Alban Ponse:
Two Finite Specifications of a Queue. Theor. Comput. Sci. 177(2): 487-507 (1997) - [e2]Dirk van Dalen, Marc Bezem:
Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers. Lecture Notes in Computer Science 1258, Springer 1997, ISBN 3-540-63172-0 [contents] - 1996
- [j14]Erik Barendsen, Marc Bezem:
Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization. Ann. Pure Appl. Log. 79(3): 221-280 (1996) - [j13]Marc Bezem, Jan Springintveld:
A Simple Proof of the Undecidability of Inhabitation in lambdaP. J. Funct. Program. 6(5): 757-761 (1996) - 1995
- [c5]Stefano Berardi, Marc Bezem, Thierry Coquand:
A realization of the negative interpretation of the Axiom of Choice. TLCA 1995: 47-62 - 1994
- [j12]Marc Bezem, Jan Friso Groote:
A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL. Comput. J. 37(4): 289-307 (1994) - [j11]Marc Bezem, Jan Keuzenkamp:
Undecidable Goals for Completed Acyclic Programs. New Gener. Comput. 12(2): 209-213 (1994) - [c4]Marc Bezem, Jan Friso Groote:
Invariants in Process Algebra with Data. CONCUR 1994: 401-416 - 1993
- [j10]Marc Bezem:
Strong Termination of Logic Programs. J. Log. Program. 15(1&2): 79-97 (1993) - [e1]Marc Bezem, Jan Friso Groote:
Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings. Lecture Notes in Computer Science 664, Springer 1993, ISBN 3-540-56517-5 [contents] - 1991
- [j9]Marc Bezem:
Semantics and Consistency of Rule-Based Expert Systems. J. Log. Comput. 1(4): 477-495 (1991) - [j8]Krzysztof R. Apt, Marc Bezem:
Acyclic Programs. New Gener. Comput. 9(3/4): 335-364 (1991) - 1990
- [j7]Marc Bezem:
Completeness of Resolution Revisited. Theor. Comput. Sci. 74(2): 227-237 (1990) - [c3]Krzysztof R. Apt, Marc Bezem:
Acyclic Programs. ICLP 1990: 617-633
1980 – 1989
- 1989
- [j6]Marc Bezem:
Compact and Majorizable Functionals of Finite Type. J. Symb. Log. 54(1): 271-280 (1989) - [c2]Marc Bezem:
Characterizing Termination of Logic Programs with Level Mappings. NACLP 1989: 69-80 - 1988
- [j5]Marc Bezem:
Equivalence of bar recursors in the theory of functionals of finite type. Arch. Math. Log. 27(2): 149-160 (1988) - [j4]Marc Bezem, Jan van Leeuwen:
On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26(6): 321-324 (1988) - [c1]Marc Bezem:
Consistency of Rule-based Expert System. CADE 1988: 151-161 - 1985
- [j3]Marc Bezem:
Strong normalization of barrecursive terms without using infinite terms. Arch. Math. Log. 25(1): 175-181 (1985) - [j2]Marc Bezem:
Isomorphisms Between HEO and HROE, ECF and ICFE. J. Symb. Log. 50(2): 359-371 (1985) - [j1]Marc Bezem:
Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. J. Symb. Log. 50(3): 652-660 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
