ALF
Edit Page
Report
Scan day: 16 February 2014 UTC
26
Virus safety - good
Description: Foundation: Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. A full integration of both programming models, so any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations.
is a language which combines functional and logic programming techniques. The foundation of ALF is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. Since ALF is a genuine integration of both programming paradigms, any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. The operational semantics of ALF is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which can be efficiently implemented. Furthermore, terms are simplified by rewriting before a narrowing step is applied and also equations are rejected if the two sides have different constructors at the top. Rewriting and rejection can result in a large reduction of the search tree. Therefore this operational semantics is more efficient than Prolog's resolution strategy.
Size: 1066 chars
Contact Information
Email:Send Message
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | The ALF System |
| Keywords: | |
| Description: | |
| IP-address: | 134.245.248.200 |
WHOIS Info
| NS | |
| WHOIS | Status: connect |
| Date | Changed: 2008-01-14T15:31:15+01:00 Changed: 2008-01-14T15:19:45+01:00 Changed: 2006-08-31T11:37:28+02:00 |