Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1974: Automata, Languages and Programming pp 157–169Cite as

Graph Representation and Computation Rules for Typeless Recursive Languages

  • Conference paper

  • 506 Accesses

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

Abstract

Computations are carried out in recursive languages by the iterative application of two kinds of transformation rules (substitution and simplification rules) to an initial term.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cadiou J.M. “Recursive definitions of partial functions and their computations”. Ph.D. Thesis. Computer Science Depat. Stanford U., 1972.

    Google Scholar 

  • Manna Z., S.Ness and J.Vuillemin. “Inductive methods for proving properties of pregrams”. CACM, pp. 491–502, August 1973.

    Google Scholar 

  • Pacini G. “An optimal fixpoint computation algorithm for a simple recursive language”. Internal Report I.F.I. 873–10, October 73.

    Google Scholar 

  • Rosen K.B.K. “Tree manipulating systems and Church Rosser theorems”. JACM, pp. 160–187, January 1973.

    Google Scholar 

  • Scott D. “Outline of a mathematical theory of computation”. Oxford U. PRO technical mono., 1970.

    Google Scholar 

  • Vuillemin J. “Correct and optimal implementations of recursion in a simple programming language”. Proc. of 5-th annual ACM Symposium or Theory of Computing. Austin,Texas. pp. 224–239, April 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienze dell’Informazione, Universita’ di Pisa, Italy

    G. Pacini, C. Montangero & F. Turini

  2. Istituto di Elaborazione dell’informazione, C.N.R., Pisa, Italy

    G. Pacini, C. Montangero & F. Turini

Authors
  1. G. Pacini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Montangero
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Turini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, 66 Saarbrücken/BRD, Deutschland

    Jacques Loeckx

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pacini, G., Montangero, C., Turini, F. (1974). Graph Representation and Computation Rules for Typeless Recursive Languages. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21545-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06841-9

  • Online ISBN: 978-3-662-21545-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation