Skip to main content
SpringerLink
Log in

On the power of self-application and higher type recursion

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

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

Included in the following conference series:

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.

5. References

  1. ABDALI, S.K. A lambda-calculus model of programming languages I, II Journal of Computer Languages, Vol. 1, Pergamon Press, (1976), pp. 287–320

    Article  Google Scholar 

  2. DAMM, W. Higher type program schemes and their tree languages Proc. 3rd GI conference on Theoretical Computer Science Lecture Notes in Computer Science 48 (1977), pp. 51–72 Springer Verlag

    Google Scholar 

  3. DAMM, W. Languages defined by higher type program schemes Proc. 4th international colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 52 (1977), pp. 164–179, Springer Verlag

    Google Scholar 

  4. DAMM, W. The IO and OI hierarchies Schriften zur Informatik und Angewandten Mathematik, RWTH Aachen (1978)

    Google Scholar 

  5. DAMM, W. Procedure schemes Schriften z. Inform. u. Angew. Math., RWTH Aachen (1978)

    Google Scholar 

  6. DAMM, W. / FEHR, E. / INDERMARK, K. Higher type recursion and self-application as control structures Proc. 1977 IFIP working conference on Formal Description of Programming Concepts, ed. E. Neuhold, North-Holland Publishing Company

    Google Scholar 

  7. EGLI, H. Typed meaning in Scott's λ-calculus models Proc. 1975 Symposium on λ-calculus in Rome, Lecture Notes in Computer Science 37 (1975), pp. 220–239, Springer Verlag

    Google Scholar 

  8. ENGELFRIET, J. / SCHMIDT, E.M. IO and OI part I and II Journal of Computer and System Sciences Vol. 15, Number 3, and Vol. 16, Number 1, pp. 67–99 (1978)

    Article  Google Scholar 

  9. FEHR, E. Eine universelle Lambda-Kalkül-Programmiersprache und ihr Interpreter Informatik-Berichte, Universität Bonn, Nr. 6 (1975)

    Google Scholar 

  10. FEHR, E. On typed and untyped λ-schemes Schriften zur Informatik und Angewandten Mathematik, RWTH Aachen (1978)

    Google Scholar 

  11. FISCHER, M.J. Grammars with macro-like productions Proc. 9th IEEE conference on Switching and Automata Theory (1968), pp. 131–142

    Google Scholar 

  12. GOGUEN, J.A. / THATCHER, J.W. / WAGNER, E.G. / WRIGHT, J.B. Initial Algebra Semantics and Continuous Algebras JACM, Vol. 24, 1 (1977), pp. 68–95

    Article  Google Scholar 

  13. GORDON, M. Operational reasoning and denotational semantics Memo AIM-264, Comp. Sci. Dept., Stanford University

    Google Scholar 

  14. McGOWAN, C.L. The correctness of a modified SECD machine Second ACM Symposium on Theory of Computing (1970)

    Google Scholar 

  15. INDERMARK, K. Schemes with recursion on higher types Proc. 5th conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 45 (1976), Springer Verlag, pp. 352–358

    Google Scholar 

  16. LANDIN, P.J. A correspondence between ALGOL 60 and Church's Lambda notation Comm. ACM, 8 (1965)

    Google Scholar 

  17. LANGMAACK, H. On procedures as open subroutines I, II Acta Informatica, Vol. 2 (1973), p. 311–333, and Vol. 3 (1974), p. 227–241

    Article  Google Scholar 

  18. LEDGARD, H. Ten mini languages: A study of topical issues in programming languages Computing Surveys, Vol. 3, No. 3 (Sept. 1971), p. 115–146

    Article  Google Scholar 

  19. MILNE, R. / STRACHEY, C. A theory of programming language semantics part a and b, Chapman and Hall (1976)

    Google Scholar 

  20. MILNER, R. Models of LCF Memo AIM-186, Stanford University (1973)

    Google Scholar 

  21. MOSSES, P. The mathematical semantics of ALGOL 60 PRG-Report, Oxford University (1974)

    Google Scholar 

  22. NIVAT, M. Languages algébriques sur le magma libre et sémantique des schémas de programme Automata, Languages, and Programming, ed. Nivat, (1972), pp. 293–307, North-Holland Publishing Company

    Google Scholar 

  23. NIVAT, M. On the interpretation of recursive program schemes Symposia Matematica, Atti del convegno d'Informatica theorica (1972), Rome

    Google Scholar 

  24. SCOTT, D. Continuous lattices Proc. of Dalhousie conference, Lecture Notes in Mathematics 274 (1972), pp. 97–134, Springer Verlag

    Google Scholar 

  25. WADSWORTH, C. The relation between computational and denotational properties for Scott's D ∞-models of the lambda-calculus SIAM, J. Computing, Vol. 5, No. 3 (Sept. 1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik II, RWTH, Aachen

    W. Damm & E. Fehr

Authors
  1. W. Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Fehr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, W., Fehr, E. (1978). On the power of self-application and higher type recursion. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation