A proof theoretic approach to failure in functional logic programming
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical fram...
Uložené v:
| Vydané v: | Theory and practice of logic programming Ročník 4; číslo 1-2; s. 41 - 74 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Cambridge, UK
Cambridge University Press
01.01.2004
|
| Predmet: | |
| ISSN: | 1471-0684, 1475-3081 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | How to extract negative information from programs is an important
issue in logic programming. Here we address the problem for
functional logic programs, from a proof-theoretic perspective. The
starting point of our work is CRWL (Constructor
based ReWriting Logic), a well established theoretical framework for
functional logic programming, whose fundamental notion is that of
non-strict non-deterministic function. We present a proof calculus,
CRWLF, which is able to deduce negative
information from CRWL-programs. In particular,
CRWLF is able to prove ‘finite’ failure of
reduction within CRWL. |
|---|---|
| Bibliografia: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 1471-0684 1475-3081 |
| DOI: | 10.1017/S1471068403001728 |