1000 search results - page 147 / 200 » Nominal rewriting systems |
147
Voted
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
164
click to vote
AGTIVE
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
148
Voted
ISMVL
2010
IEEE
15 years 10 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
174
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
117
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...