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 Turing-complete 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.
Research partially supported by the Treaty of Windsor Grant: “Linearity: Programming Languages and Implementations”, and by funds granted to LIACC through the Programa de Financiamento Plurianual, Fundação para a Ciência e Tecnologia and FEDER/POSI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: Computational Interpretations of Linear Logic. Theoretical Computer Science 111(3), 3–57 (1993)
Alves, S., Fernández, M., Florido, M., Mackie, I.: The power of linear functions. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 119–134. Springer, Heidelberg (2006)
Alves, S., Fernández, M., Florido, M., Mackie, I.: Gödel’s System T revisited. Technical Report TR-07-02, King’s College London (2007)
Alves, S., Fernández, M., Florido, M., Mackie, I.: Iterator types. In: Seidl, H. (ed.) FOSSACS 2007, vol. 4423, pp. 17–31. Springer, Heidelberg (2007)
Alves, S., Fernández, M., Florido, M., Mackie, I.: Very primitive recursive functions. In: Computation and Logic in the Real World, CiE 2007, Quaderni del Dipartimento di Scienze Matematiche e Informatiche Roberto Magari (2007)
Asperti, A.: Light affine logic. In: Proc. Logic in Computer Science (LICS’98), pp. 300–308. IEEE Computer Society, Washington (1998)
Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Transactions on Computational Logic 3(1), 137–175 (2002)
Baillot, P., Mogbil, V.: Soft lambda-calculus: a language for polynomial time computation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 27–41. Springer, Heidelberg (2004)
Brainerd, W.S., Landweber, L.H.: Theory of Computation. John Wiley and Sons, Inc, New York, NY, USA (1974)
Burroni, A.: Récursivité graphique, I: Catégorie des fonctions récursives primitives formelles. Cahiers de topologie et géométrie différentielle catégoriques, XXVII:49 (1986)
Girard, J.-Y.: Light linear logic. Information and Computation 143(2), 175–204 (1998)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50(1), 1–102 (1987)
Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989)
Girard, J.-Y., Scedrov, A., Scott, P.J.: Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science 97, 1–66 (1992)
Gladstone, M.: A reduction of the recursion scheme. J. Symb. Logic, 32 (1967)
Gladstone, M.: Simplification of the recursion scheme. J. Symb. Logic 36 (1971)
Kleene, S.C.: Introduction to Metamathematics. North-Holland (1952)
Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163–180 (2004)
Lawvere, F.: An elementary theory of the category of sets. Proc. Nat. Acad. Sci. 52 (1964)
Mackie, I., Román, L., Abramsky, S.: An internal language for autonomous categories. Journal of Applied Categorical Structures 1(3), 311–343 (1993)
Odifreddi, P.: Classical recursion theory. Elsevier Science, Amsterdam (1999)
Robinson, R.: Primitive recursive functions. Bull. Am. Math. Soc., 53 (2004)
Shoenfield, J.: Recursion Theory. Springer, Heidelberg (1993)
Stern, J.: Fondements Mathematiques de L’Informatique. Ediscience International, Paris (1994)
Terui, K.: Light affine calculus and polytime strong normalization. In: Proc. Logic in Computer Science (LICS 2001), IEEE Computer Society, Washington (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alves, S., Fernández, M., Florido, M., Mackie, I. (2007). Linear Recursive Functions. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds) Rewriting, Computation and Proof. Lecture Notes in Computer Science, vol 4600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73147-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-73147-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73146-7
Online ISBN: 978-3-540-73147-4
eBook Packages: Computer ScienceComputer Science (R0)