On an interpretation of safe recursion in light affine logic
We introduce a subalgebra <em>BC</em><sup>−</sup> of Bellantoni and Cook's safe-recursion function algebra <em>BC</em>. Functions of the subalgebra have safe arguments that are non-contractible (i.e non-duplicable). We propose a definition of safe and normal...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2004
|
| Subjects: |