1263 search results - page 96 / 253 » Packaging Mathematical Structures |
75
Voted
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
92
Voted
ACSD
2001
IEEE
15 years 1 months ago
2001
IEEE
We describe a framework where formal models can be rigorously defined and compared, and their interconnections can be unambiguously specified. We use trace algebra and trace struc...
62
Voted
APAL
2007
14 years 10 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
95
Voted
EJC
2008
14 years 10 months ago
2008
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
76
Voted
JLP
2010
14 years 8 months ago
2010
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...