7109 search results - page 292 / 1422 » Process Algebra with Combinators |
135
click to vote
IJCAI
1989
15 years 6 months ago
1989
This paper considers the composition of tuples from two relations in order to derive additional tuples of one of these relations. Our purpose is to determine when the composition i...
118
click to vote
ARSCOM
2007
15 years 4 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
148
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
137
click to vote
ENTCS
2008
15 years 4 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...
126
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...