20 search results - page 2 / 4 » Continuous semantics for strong normalisation |
CTCS
1997
Springer
13 years 9 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
LICS
2008
IEEE
13 years 12 months ago
2008
IEEE
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
MST
2007
13 years 5 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
OSDI
2000
ACM
13 years 7 months ago
2000
ACM
The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from eithe...
ICMCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Many documentary videos use background music to help structure the content and communicate the semantic. In this paper, we investigate semantic segmentation of documentary video u...