Sciweavers

4966 search results - page 80 / 994
» its 2010
Sort
View
ENTCS
2007
161views more  ENTCS 2007»
15 years 6 months ago
Bialgebraic Methods in Structural Operational Semantics: Invited Talk
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
Bartek Klin
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Amb Breaks Well-Pointedness, Ground Amb Doesn't
McCarthy’s amb operator has no known denotational semantics, and its basic operational properties - the context lemma, the compatibility of refinement similarity and convex bis...
Paul Blain Levy
ENTCS
2007
86views more  ENTCS 2007»
15 years 6 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée
ENDM
2000
131views more  ENDM 2000»
15 years 6 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar
ENDM
2000
60views more  ENDM 2000»
15 years 6 months ago
The graph sandwich problem for 1-join composition is NP-complete
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
Celina M. Herrera de Figueiredo, Sulamita Klein, K...