Monadic Program Schemes under Restricted Classes of Free Interpretations | SpringerLink
Skip to main content
Springer Nature Link
Log in

Monadic Program Schemes under Restricted Classes of Free Interpretations

  • Conference paper
Automata, Languages and Programming (ICALP 1974)

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

Included in the following conference series:

  • 527 Accesses

Abstract

Properties of value languages and translatability results of monadic program schemes under three restricted classes of interpretations (threshold counter, multiple threshold counter, and finite automaton interpretations) are presented.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 4575
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 5719
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dilger, W., P. Raulefs, Monadic Program Schemes under Restricted Classes of Free Interpretations (in preparation).

    Google Scholar 

  2. Ginsburg, S., S. Greibach, Abstract Families of Languages, MAMS, 87 (1969), 1–32.

    MathSciNet  Google Scholar 

  3. Garland, S., D.C. Luckham, Program Schemes, Recursion Schemes, and Formal Languages, JCSS, 7 (1973), 119–160.

    MathSciNet  MATH  Google Scholar 

  4. Hewitt, C., More Comparative Schematology, M.I.I. A.I-Memo No. 207 (Aug. 1970).

    Google Scholar 

  5. Luckham, D.C., D.M.R. Park, M.S. Paterson, On Formalized Computer Program, JCSS, 4 (1970), 220–249.

    MathSciNet  MATH  Google Scholar 

  6. Paterson, M.S., C. Hewitt, Comparative Schematology, M.I.I. A.I.-Memo No. 201 (Nov. 1970)

    Google Scholar 

  7. Strong, H.R., Translating Recursion Equations into Flow Charts, JCSS, 5 (1971), 254–285.

    MathSciNet  MATH  Google Scholar 

  8. Shepherdson, J.C., H.E. Sturgis, Computability of Recursive Functions, JACM, 10 (1963), 217–255.

    Article  MathSciNet  MATH  Google Scholar 

  9. Walker, S.A., H.R. Strong, Characterisations of Flowchartable Recursions, JCSS, 7 (1973), 404–447.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Author notes

  1. Werner Dilger

    Present address: Fachbereich Philosophie, Universität Konstanz, Germany

Authors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, D-7500, Karlsruhe 1, Postfach 6380, Fed. Rep. Germany

    Werner Dilger & Peter Raulefs

Authors
  1. Werner Dilger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Raulefs
    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

Dilger, W., Raulefs, P. (1974). Monadic Program Schemes under Restricted Classes of Free Interpretations. 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_42

Download citation

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

  • 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