1390 search results - page 120 / 278 » On the Algebraic Structure of Convergence |
142
click to vote
IFIPTCS
2000
15 years 10 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
173
click to vote
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
166
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
159
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
212
click to vote
ENTCS
2010
15 years 3 months ago
2010
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...