Linear recursive functions

Authors:
Sandra Alves;Maribel Fernández;Mário Florido;Ian Mackie
Affiliations:
University of Porto, Department of Computer Science & LIACC, R. do Campo, Porto, Portugal;King's College London, Department of Computer Science, Strand, London, UK;University of Porto, Department of Computer Science & LIACC, R. do Campo, Porto, Portugal;LIX, CNRS UMR 7161, École Polytechnique, Palaiseau Cedex, France
Venue:
Rewriting Computation and Proof
Year:
2007

Citing 12
Cited 2

Linear logic

Theoretical Computer Science
Proofs and types

Proofs and types
Bounded linear logic: a modular approach to polynomial-time computability

Theoretical Computer Science
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Recursion theory

Recursion theory
Light linear logic

Information and Computation
Intuitionistic Light Affine Logic

ACM Transactions on Computational Logic (TOCL)
Theory of Computation

Theory of Computation
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Soft linear logic and polynomial time

Theoretical Computer Science - Implicit computational complexity
Iterator types

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
The power of linear functions

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Linearity and recursion in a typed Lambda-calculus

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linearity and PCF: a semantic insight!

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying don't need to be explicitly included in Turing-complete computation models: in this paper we show that the class of partial recursive functions that are syntactically linear (that is, partial recursive functions where no argument is erased or copied) is Turing-complete