Sciweavers

1679 search results - page 58 / 336
» Strong order equivalence
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
ILP
2004
Springer
14 years 3 months ago
Generalization Algorithms for Second-Order Terms
In this paper, we study the generalization algorithms for second-order terms, which are treated as first-order terms with function variables, under an instantiation order denoted ...
Kouichi Hirata, Takeshi Ogawa, Masateru Harao
TPHOL
2003
IEEE
14 years 3 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
CDC
2009
IEEE
261views Control Systems» more  CDC 2009»
14 years 2 months ago
Stability and stabilization of a class of ill-conditioned second order differential linear repetitive processes
: This paper considers differential linear repetitive processes which are a distinct class of 2D systems whose dynamics evolve over a subset of the upper right quadrant of the 2D p...
Pawel Grzegorz Dabkowski, Krzysztof Galkowski, Eri...
CORR
2007
Springer
162views Education» more  CORR 2007»
13 years 10 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin