Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Claudio Hermida"'
Publikováno v:
Mathematical Structures in Computer Science. 32:442-471
We investigate how various forms of bisimulation can be characterised using the technology of logical relations. The approach taken is that each form of bisimulation corresponds to an algebraic structure derived from a transition system, and the gene
Publikováno v:
MFPS
This paper extends the results of Hermida's thesis about logical predicates to more general logical relations and a wider collection of types. The extension of type constructors from types to logical relations is derived from an interpretation of tho
Publikováno v:
Electronic Notes in Theoretical Computer Science. 303:149-180
In his seminal paper on “Types, Abstraction and Parametric Polymorphism,” John Reynolds called for homomorphisms to be generalized from functions to relations. He reasoned that such a generalization would allow type-based “abstraction” (repre
Publikováno v:
Theoretical Computer Science. 492:117-122
In this addendum, we correct some typos and fill a gap in the proof of Theorem 21 of [F. van Breugel, C. Hermida, M. Makkai, J. Worrell. Recursively defined metric spaces without contraction. Theoretical Computer Science 380 (1/2) (2007) 143–163].
Autor:
Robert D. Tennent, Claudio Hermida
Publikováno v:
MFPS
Given any symmetric monoidal category C, a small symmetric monoidal category @S and a strong monoidal functor j:@S->C, we construct C[x:j@S], the polynomial category with a system of (freely adjoined) monoidal indeterminates x:I->j(w), natural in w@?
Autor:
Claudio Hermida
Publikováno v:
Information and Computation. 209(12):1505-1517
We characterise bicategories of spans, relations and partial maps universally in terms of factorisations involving maps. We apply this characterisation to show that the standard modalities □ and ⋄ arise canonically as extensions of a predicate lo
Publikováno v:
Theoretical Computer Science. 380(1-2):143-163
In this paper we use the theory of accessible categories to find fixed points of endofunctors on the category of 1-bounded complete metric spaces and nonexpansive functions. In contrast to previous approaches, we do not assume that the endofunctors a
Autor:
Robert D. Tennent, Claudio Hermida
Publikováno v:
Theoretical Computer Science. 375(1-3):3-19
Autor:
Claudio Hermida
Publikováno v:
Applied Categorical Structures. 12:427-459
We consider pseudo-descent in the context of 2-fibrations. A 2-category of descent data is associated to a 3-truncated simplicial object in the base 2-category. A morphism q in the base induces (via comma-objects and pullbacks) an internal category w
Autor:
Claudio Hermida
Publikováno v:
Galois Theory, Hopf Algebras, and Semiabelian Categories. :281-293