Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Automata and computability.. Undergraduate texts in computer science Springer, (1997)Natural Transformations as Rewrite Rules and Monad Composition.. Logical Methods in Computer Science, (2019)Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming., , , , and . CoRR, (2016)A finite model theorem for the propositional μ-calculus.. Stud Logica, 47 (3): 233-241 (1988)CoCaml: Functional Programming with Regular Coinductive Types., , and . Fundam. Informaticae, 150 (3-4): 347-377 (2017)On Free ω-Continuous and Regular Ordered Algebras., and . Log. Methods Comput. Sci., (2019)Nominal Kleene Coalgebra., , , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 286-298. Springer, (2015)A Programming Language for the Inductive Sets, and Applications., and . ICALP, volume 140 of Lecture Notes in Computer Science, page 313-329. Springer, (1982)A Complete Gentzen-Style Axiomatization for Set Constraints., and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 134-145. Springer, (1996)On Induction vs. *-Continuity.. Logic of Programs, volume 131 of Lecture Notes in Computer Science, page 167-176. Springer, (1981)