2286 search results - page 76 / 458 » Algorithms for Categorical Equivalence |
BIRTHDAY
2000
Springer
15 years 2 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
LICS
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
ENTCS
2006
14 years 10 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
ACS
2002
14 years 9 months ago
2002
We define the notions of Azumaya category and Brauer group in category theory enriched over some very general base category V. We prove the equivalence of various definitions, in ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...