Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Edmund Robinson"'
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
Autor:
Edmund Robinson
Publikováno v:
Human Rights Law Review. 23
This article identifies a troubling omission on the part of the European Court of Human Rights, when it considers cases involving the Hague Convention on the Civil Aspects of International Child Abduction. Such cases often involve one parent, who has
Publikováno v:
Studia Logica. 109:313-339
This paper proposes a generalization of the Kripke semantics of intuitionistic logicIL appropriate forintuitionistic Łukasiewicz logicIŁL —a logic in the intersection betweenIL and (classical) Łukasiewicz logic. This generalised Kripke semantics
Autor:
Edmund Robinson, Kimberley N. Trapp
Publikováno v:
McGill Law Journal. 63:677-700
Respect for human rights is often understood to be in tension with a robust approach to protecting human security (both within a single state’s territory and across territorial boundaries). Principles like those which form the basis of Fox and Crid
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:
Journal of Logic and Computation. 24:283-301
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory. © 2012 The Author, 2012.
Autor:
Edmund Robinson
Publikováno v:
Journal of Logic and Computation. 13:777-797
Autor:
Edmund Robinson
Publikováno v:
Formal Aspects of Computing. 13:308-326
This is a largely tutorial paper about the categorical notion of monad and the ways in which monads on different categories correspond to variations on the standard notion of algebraic theory.
Autor:
John Power, Edmund Robinson
Publikováno v:
MFPS
We study modularity in denotational semantics. We define the notion of a dyad, generalising the notion of monad, and we define the notion of symmetric premonoidal dyad, generalising the notion of strong monad. We show how dyads give rise to semantic