Name
Abstract | ||
|---|---|---|
A relevant drawback of current implementations of logic programming languages is represented by the use of substitutions to keep bindings of logical variables, l-variables. Powerful compilation techniques, i.e. translation to combinatory logic, and implementation techniques such as reduction machines, have shown how to overcome this problem in the context of functional languages. The paper addresses a similar approach to equational logic programming: equations are translated into variable-free combinations and correspondingly narrowing is reformulated in terms of a set of reduction rules. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-52590-4_39 | CAAP |
Keywords | Field | DocType |
combinatory form,equational programming instance,equational programming,combinatory forms,equational logic,functional language | Functional logic programming,Programming language,Functional programming,Combinatory logic,Unification,Implementation,Equational logic,Logic programming,Philosophy of logic,Mathematics | Conference |
Volume | ISSN | ISBN |
431 | 0302-9743 | 0-387-52590-4 |
Citations | PageRank | References |
3 | 0.42 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Bellia | 1 | 68 | 8.68 |
| Michele Bugliesi | 2 | 12 | 1.28 |
| M. E. Occhiuto | 3 | 6 | 1.18 |