500 search results - page 26 / 100 » ACD Term Rewriting |
HOA
1993
15 years 1 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
GLVLSI
2002
IEEE
15 years 2 months ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
ENTCS
2007
14 years 9 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
AGTIVE
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
AISC
2006
Springer
15 years 1 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...