30 search results - page 5 / 6 » On Constructor Rewrite Systems and the Lambda-Calculus |
ENTCS
2007
13 years 5 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...
TACS
1994
Springer
13 years 9 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
WFLP
2000
Springer
13 years 9 months ago
2000
Springer
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
FLOPS
2010
Springer
13 years 4 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...