Name
Abstract | ||
|---|---|---|
We present a new interpreter for $$\\lambda $$Prolog that runs consistently faster than the byte code compiled by Teyjus, that is considered the best available implementation of $$\\lambda $$Prolog. The key insight is the identification of a fragment of the language, which we call reduction-free fragment $$\\mathcal {L}_\\lambda ^\\beta $$, that occurs quite naturally in $$\\lambda $$Prolog programs and that admits constant time reduction and unification rules. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48899-7_32 | LPAR |
Field | DocType | Volume |
Programming language,Computer science,Unification,Algorithm,Interpreter,Prolog,Byte code,Proof assistant,Lambda | Conference | 9450 |
ISSN | Citations | PageRank |
0302-9743 | 7 | 0.42 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cvetan Dunchev | 1 | 25 | 3.03 |
| Ferruccio Guidi | 2 | 90 | 10.72 |
| Claudio Sacerdoti Coen | 3 | 384 | 40.66 |
| Enrico Tassi | 4 | 327 | 21.79 |