Loading...
Please wait, while we are loading the content...
Similar Documents
Lnca: a lazy narrowing calculus for applicative term rewriting systems (1999).
| Content Provider | CiteSeerX |
|---|---|
| Author | Marin, Mircea Ida, Tetsuo Middeldorp, Aart Yanagi, Takura |
| Abstract | The integration of higher-order functions into functional logic programming is widely seen as a powerful and desirable feature. The natural way to deal with higher-order functions in the well-studied framework of first-order term rewriting is through so-called applicative term rewriting systems (ATRSs). We propose a new calculus, called LNCA, to deal efficiently with confluent ATRSs and prove its soundness and completeness. |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Lazy Narrowing Calculus Applicative Term Rewriting System Higher-order Function Functional Logic Programming First-order Term Rewriting New Calculus So-called Applicative Term Desirable Feature Confluent Atrss Well-studied Framework Natural Way |
| Content Type | Text |
