17 search results - page 1 / 4 » flops 2004 |
162
click to vote
FLOPS
2004
Springer
16 years 9 days ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
171
Voted
FLOPS
2004
Springer
16 years 9 days ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...