Bezem, Marc, 1956-....
Bezem, Marc (Marcus Aloysius), 1956-
Bezem, M. (Marc), 1956-
Bezem, M.
Bezem, Marc
Marcus Aloysius Bezem Ph.D. Universiteit Utrecht 1986
VIAF ID: 57288699 ( Personal )
Permalink: http://viaf.org/viaf/57288699
Preferred Forms
-
-
-
- 100 1 0 ‡a Bezem, M. ‡q (Marc), ‡d 1956-
-
-
-
- 100 1 _ ‡a Bezem, Marc ‡d 1956-
-
- 100 1 _ ‡a Bezem, Marc, ‡d 1956-....
- 100 0 _ ‡a Marcus Aloysius Bezem ‡c Ph.D. Universiteit Utrecht 1986
4xx's: Alternate Name Forms (7)
Works
Title | Sources |
---|---|
Acyclic programs : (extended abstract) | |
Bar recursion and functionals of finite type | |
Bar recursion versus polymorphism : extended abstract | |
Clausification in Coq | |
Completeness of resolution by transfinite induction | |
Computer science logic : 10th international workshop, CSL'96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996 : selected papers | |
A correctness proof of a one-bit sliding window protocol in mCRL | |
Counting Instances of Software Components | |
Diagram techniques for confluence | |
Dirk van Dalen Festschrift | |
Extensionality of simply typed logic programs | |
Formalizing process algebraic verifications in the calculus of constructions | |
Formulas as programs | |
Impredicative recursion : terms depending on order types : (extended abstract) | |
Inter'l. Conf. on Typed Lambda Calculi and Applic. (1993 : Utrecht, Netherlands). Typed Lambda calculi and applications, c1993: | |
Invariants in process algebra with data | |
Metrics for classifying heterogeneous objects | |
On downward closure ordinals of logic programs | |
Polymorphic extensions of simple type structures : with an application to a bar recursive minimization | |
Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics | |
Semantics and consistency of rule-based expert systems | |
Strong termination of logic programs | |
Term rewriting systems | |
TLCA '93 |