Sciweavers

71 search results - page 3 / 15
» Complete Cuboidal Sets in Axiomatic Domain Theory
Sort
View
PPDP
2010
Springer
13 years 4 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
DAGSTUHL
2007
13 years 7 months ago
Measuring Ranks via the Complete Laws of Iterated Contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
Wolfgang Spohn
JSYML
2010
107views more  JSYML 2010»
13 years 4 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
NJC
2006
86views more  NJC 2006»
13 years 6 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal
BIRTHDAY
2005
Springer
13 years 11 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...