Skip to main content
SpringerLink
Log in

Intensionality versus extensionality and Primitive Recursion

  • Conference paper
  • First Online:
Concurrency and Parallelism, Programming, Networking, and Security (ASIAN 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1179))

Included in the following conference series:

Abstract

The set of primitive recursive functions (pr) accepts many definitions. We study three languages (presented as rewriting rules) that compute pr functions and show that they do not have the same intensional behaviour (a new function associate to algorithm) from an input/output point of view (i.e. they do not compute in the same way): classical Primitive Recursion (PR), Primitive Recursion with Variable parameters (PRV) and Primitive Recursion on Lists of integers (PRL). We use denotational semantics to formally study the behaviour of algorithms. We give a complete characterization of the intensional behaviour of the language PR. We show that all unary increasing pr functions and a large class of stable pr functions may be an intensional behaviour of PRV and PRL.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Loic Colson. About primitive recursive algorithms. Theoretical Computer Science, 83, pp57–69, 1991.

    Article  Google Scholar 

  2. Loic Colson. Représentation intensionnelle d'algorithmes dans les systèmes fonctionnels. Thèse de doctorat, Université P 7, 1991.

    Google Scholar 

  3. Loic Colson. A unary representation result for system T. Mejanne le Clap Act special issue of Theoretical Computer Science, 1996.

    Google Scholar 

  4. Thierry Coquand. Une preuve directe du théorème d'ultime obstination. Compte Rendus de l'Académie des Sc., 314, Serie I, 1992.

    Google Scholar 

  5. Martin Hotzel Escardo. On lazy natural numbers with applications. SIGACT News, 24(1), 1993.

    Google Scholar 

  6. P. Taylor J.Y. Girard, Y. Lafont. Proofs and Types, volume 7. Cambridge Tracts in Theorical Comp. Sci., 1989.

    Google Scholar 

  7. Pierre Valarcher. Contribution à l'etude du comportement intentionel des algorithmes: le cas de la récursion primitive. Thèse de doctorat, Université P 7, 1996.

    Google Scholar 

  8. Pierre Valarcher. A complete characterization of intensional behaviours of primitive recursive algorithms. Rapport de Recherche du LIR, 96.11, 1996. Submitted to TCS.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences et de Techniques, Laboratoire d'Informatique de Rouen, 76821, Mont-Saint-Aignan Cedex

    Pierre Valarcher

Authors
  1. Pierre Valarcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valarcher, P. (1996). Intensionality versus extensionality and Primitive Recursion. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027787

Download citation

  • DOI: https://doi.org/10.1007/BFb0027787

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation