2076 search results - page 182 / 416 » Functional logic overloading |
130
Voted
JLP
2007
15 years 3 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
124
Voted
ICTAI
2002
IEEE
15 years 8 months ago
2002
IEEE
In order to reduce the time-to-market and simplify gatelevel test generation for digital integrated circuits, GAbased functional test generation techniques are proposed for behavi...
122
Voted
SFP
2004
15 years 4 months ago
2004
Abstract: Forms are parts of a graphical user interface (GUI) that show a (structured) value and allow the user to update it. Some forms express a choice between two or more (struc...
133
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
123
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...