Suchergebnisse - Bezem, Marc

Acyclic programs: (extended abstract)

von Apt, Krzysztof R. 1949-, Bezem, Marc

Online lesen (frei zugänglich)

Strong termination of logic programs

von Bezem, Marc

Bar recursion and functionals of finite type

von Bezem, Marc

Generalizing hamming distance to finite sets

von Bezem, Marc, Keijzer, Maarten

Diagram techniques for confluence

von Bezem, Marc, Klop, Jan Willem 1945-, Oostrom, Vincent van

On the computational content of the Axiom of Choice

von Berardi, Stefano, Bezem, Marc, Coquand, Thierry 1961-

A formal verification of the alternating bit protocol in the calculus of constructions

von Bezem, Marc, Groote, Jan F.

Completeness of resolution by transfinite induction

von Bezem, Marc

Proving a graph well founded using resolution: (a case study in automated verification)

von Bezem, Marc, Groote, Jan F.

A correctness proof of a one-bit sliding window protocol in MyCRL

von Bezem, Marc, Groote, Jan F.

Invariants in process algebra with data

von Bezem, Marc, Groote, Jan F.

Bar recursion versus polymorphism

von Barendsen, Erik, Bezem, Marc

Ramsey's theorem and the pigeonhole principle in intuitionistic mathemathics

von Veldman, Willem H., Bezem, Marc

Bar recursion versus polymorphism: extended abstract

von Barendsen, Erik, Bezem, Marc

Impredicative recursion: terms depending on order types ; (extended abstract)

von Bezem, Marc

On downward closure ordinals of logic programs

von Bagai, Rajiv, Bezem, Marc, Van Emden, Maarten H.

Semantics and consistency of rule-based expert systems

von Bezem, Marc

Characterizing termination of logic programs with level mappings

von Bezem, Marc

Characterizing termination of logic programs with level mapping

von Bezem, Marc

Consistency of rule-based expert systems

von Bezem, Marc