2911 search results - page 495 / 583 » A Logic of Graph Constraints |
143
Voted
CADE
2005
Springer
16 years 27 days ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
103
click to vote
PODS
2007
ACM
16 years 21 days ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
113
click to vote
ICFP
2006
ACM
16 years 16 days ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ICFP
2003
ACM
16 years 16 days ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
104
click to vote
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Power is an increasingly important design constraint for FPGAs in nanometer technologies. Because interconnect power is dominant in FPGAs, we design Vdd-programmable interconnect ...