Sciweavers

1679 search results - page 20 / 336
» Strong order equivalence
Sort
View
ALP
1997
Springer
14 years 2 months ago
Perpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
Zurab Khasidashvili, Mizuhito Ogawa
CBSE
2008
Springer
13 years 11 months ago
State Space Reduction Techniques for Component Interfaces
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
Markus Lumpe, Lars Grunske, Jean-Guy Schneider
JOLLI
2007
88views more  JOLLI 2007»
13 years 9 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
STACS
2009
Springer
14 years 4 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
FOSSACS
1999
Springer
14 years 2 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro