Sciweavers

1302 search results - page 19 / 261
» Fair Equivalence Relations
Sort
View
FP
1991
95views Formal Methods» more  FP 1991»
13 years 11 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
APPML
2010
86views more  APPML 2010»
13 years 7 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
ACL
1998
13 years 9 months ago
Recognition of the Coherence Relation between Te-linked Clauses
This paper describes a method for recognizing coherence relations between clauses which are linked by te in Japanese -- a translational equivalent of English and. We consider that...
Akira Oishi, Yuji Matsumoto
ENTCS
2006
119views more  ENTCS 2006»
13 years 7 months ago
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besid...
Marco Bernardo
TLCA
2005
Springer
14 years 1 months ago
Relational Reasoning in a Nominal Semantics for Storage
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...
Nick Benton, Benjamin Leperchey