3454 search results - page 70 / 691 » Modern computer algebra |
149
Voted
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
146
Voted
PODS
1999
ACM
15 years 10 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
175
click to vote
IMAMS
2007
15 years 7 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
282
Voted
ENTCS
2006
15 years 5 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...