Bpf Bart Jacobs
Radboud University Nijmegen
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Bpf Bart Jacobs.
Journal of Logic and Computation | 2010
Bpf Bart Jacobs; Ana Sokolova
This article investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains and Markov processes, as coalgebras of the powerset, finitely supported multiset, finitely supported distribution and measure functor, respectively. Expressivity means that logically indistinguishable states, satisfying the same formulas, are behaviourally indistinguishable. The investigation is based on the framework of dual adjunctions between spaces and logics and focuses on a crucial injectivity property. The approach is generic both in the choice of systems and modalities, and in the choice of a ‘base logic’. Most of these expressivity results are already known, but the applicability of the uniform setting of dual adjunctions to these particular examples is what constitutes the contribution of the article.
Information & Computation | 2006
Bpf Bart Jacobs
This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using an extended form of coinduction via distributive laws.
Theoretical Computer Science | 2011
Bpf Bart Jacobs
Probabilities are understood abstractly as forming a monoid in the category of eect algebras. They can be added, via a partial operation, and multiplied. This generalises key properties of the unit interval [0; 1]. Such eect
Theoretical Computer Science | 1992
Bpf Bart Jacobs; Ines Margaria; Maddalena Zacchi
Abstract Using ideas and results from Barendrecht (1983) and Coppo (1984) on intersection types, a comparable theory is developed for (second order) polymorphic types. The set of filters constructed with polymorphic type forms, with inclusion, a continuous lattice which yields a model of what we call βη-expansion (i.e. the value of a term increases under βη-reduction), but not of β-conversion. Combining intersection with polymorphic types does give filter λ-models, but the two standard ways of interpreting λ-terms do not coincide.
Logical Methods in Computer Science | 2007
Ichiro Hasuo; Bpf Bart Jacobs; Ana Sokolova
Theoretical Computer Science | 2004
Jesse Hughes; Bpf Bart Jacobs
Image and Vision Computing | 2009
Bam Ben Schouten; Bpf Bart Jacobs
formal aspects in security and trust | 2009
W Wessel de Jonge; Bpf Bart Jacobs
foundations of software science and computation structure | 2008
Ichiro Hasuo; Bpf Bart Jacobs; Ana Sokolova
Physical Review Letters | 2008
E Hubbers; Bpf Bart Jacobs; Berry Schoenmakers; van Hca Henk Tilborg; de Bmm Benne Weger