31 search results - page 2 / 7 » Cobham's theorem for substitutions |
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
FSTTCS
1999
Springer
13 years 9 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
ITA
2002
13 years 4 months ago
2002
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...
TABLEAUX
2000
Springer
13 years 8 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...