Skip to main content
SpringerLink
Log in

Funktionale Programmierung — Der funktions-orientierte Programmierstil

  • Chapter
Programmiermethoden der Künstlichen Intelligenz

Part of the book series: Studienreihe Informatik ((STUDIENREIHE))

  • 71 Accesses

Zusammenfassung

In vielen Einführungen in die Programmierung wird naiv angenommen, daß Programme aus Ketten von Befehlen bestehen, mit denen ein Algorithmus realisiert wird. Programmieren als das Planen von sequentiell ablaufenden Aktionen gilt als der Inbegriff dessen, was zur Steuerung einer Rechenanlage unternommen werden muß.

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

Access this chapter

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 49.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. H. Abelson, G.J. Sussman: Structure and Interpretation of Computer Programs. MIT Press, Cambridge, 1984

    Google Scholar 

  2. J. Allen: Anatomy of LISP. McGraw-Hill, New York etc., 1978

    MATH  Google Scholar 

  3. J. Backus, J.H. Williams, E.L. Wimmers: FL Language Manual. IBM Res. Rep. RJ 5339, IBM Almaden Research Center, San Jose, Nov. 1986

    Google Scholar 

  4. J. Backus: Can Programming be Liberated from the von Neuman Style? A Functional Style and its Algebra of Programs. Comm. ACM, Vol. 21 (1978), No. 8, S. 613–641

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Bailey: A Hope Tutorial. Byte, August 1985, S. 235-258

    Google Scholar 

  6. H.P. Barendregt: The Lambda Calculus, its Syntax and Semantics. North Holland Publ., Amsterdam, 2nd ed., 1984

    MATH  Google Scholar 

  7. D.W. Barron: Recursive Techniques in Programming. MacDonald, London, 1968

    Google Scholar 

  8. D.W. Barron, C. Strachey: Programming, in: Fox. [20]

    Google Scholar 

  9. R. Bornat: Programming From First Principles. Prentice Hall, Hemel Hempstead, 1987

    Google Scholar 

  10. M. Broy: Funktionales Programmieren — Programmieren mit Funktionalen, in: I. Kupka (Hrsg.): 13. GI Jahrestagung, Informatik Fachberichte 73, Springer, Berlin etc., 1983, S. 24–40

    Google Scholar 

  11. W.H. Burge: Recursive Programming Techniques. Addison-Wesley, Reading etc., 1975

    MATH  Google Scholar 

  12. W.H. Burge: The Evaluation, Classification and Interpretation of Expressions. Proc. 19.th National ACM Conf., New York, 1964

    Google Scholar 

  13. R. Burstall, D. MacQueen, D. Sanella: Hope — An Experimental Applicative Language. Report CSR-62-80, Computer Science Dept., Edinburgh University, Edinburgh, 1980

    Google Scholar 

  14. J.M. Cadiou: Recursive Definitions of Partial Functions and Their Computation. Stanford University, Dept. of Computer Science, STAN-CS-266-72, Stanford, 1972

    Google Scholar 

  15. A. Church: The Calculi of Lambda-Conversion. Ann. of Math. Studies, Vol. 6, Princeton, 1941

    Google Scholar 

  16. H.B. Curry, R. Feys: Combinatory Logic. North Holland, Amsterdam, 1958

    MATH  Google Scholar 

  17. J. Darlington, P. Henderson, D.A. Turner (eds.): Functional Programming and its Application. Cambridge University Press, Cambridge etc., 1982

    Google Scholar 

  18. J. Dennis, D.P. Misunas: A Preliminary Architecture for a Basic Data-Flow Processor. Proc. 2nd Annual Symposium on Computer Architecture. IEEE, New York, 1975

    Google Scholar 

  19. A. Evans: PAL — A Language Designed for Teaching Programming Linguistics. Proc. 1968 ACM National Conference, 1968, S. 395-403

    Google Scholar 

  20. L. Fox (ed.): Advances in Programming and Non-numerical Computation. (1963 Summer School in Oxford), Pergamon Press, Oxford etc., 1966

    Google Scholar 

  21. D.P. Friedman, M. Wand, C.T. Haynes, E. Kohlbecker, W. Clinger: Fundamental Abstractions of Programming Languages. Computer Science Departement, Indiana University, Course Notes, Indiana, 1984

    Google Scholar 

  22. D.P. Friedman, D. Wise: CONS Should Not Evaluate ist Arguments. Proc. 3rd Internat. Colloq. on Automata, Languages and Programming, Edinburgh Univ. Press, Juli 1976, S. 257-284

    Google Scholar 

  23. P.C. Gilmore: An Abstract Computer with a LISP-like Machine Language without a Label Operator, in: P. Brafford, D. Hirschberg (eds.): Computer Programming and Formal Sytems. North Holland PubL, Amsterdam, 1963, S. 71–86

    Chapter  Google Scholar 

  24. M. Gordon, R. Milner, C. Wadsworth, G. Cousineau, G. Huet, L. Paulon: The ML Handbook. Version 5.1, INRIA, Rocquencourt, Okt. 1984

    Google Scholar 

  25. P. Henderson: Functional Programming — Application and Implementation. Prentice Hall, Englewood Cliffs etc., 1980

    MATH  Google Scholar 

  26. P. Henderson, J.M. Morris: A Lazy Evaluator. Proc. 3rd POPL Symposium, Atlanta, 1976

    Google Scholar 

  27. J.R. Hindley, J.P. Seldin: Introduction to Combinators and the Lambda Calculus. Cambridge University Press, Cambridge etc., 1986

    Google Scholar 

  28. K.E. Iverson: A Programming Language. Wiley, New York, 1962

    MATH  Google Scholar 

  29. P.R. Kosinski: A Data Flow Programming Language. IBM Res. Rep. RC-4264, Yorktown Heights, 1973

    Google Scholar 

  30. P.J. Landin: A Lambda-Calculus Approach, in [15]

    Google Scholar 

  31. P.J. Landin: An Abstract Machine for Designers of Computing Languages. Proc. IFIP Congress 1965, Vol. 2, Spartan Books, Washington, 1966

    Google Scholar 

  32. P.J. Landin: The Next 700 Programming Languages. Comm. ACM, Vol. 9 (1966), No. 3, S. 157–166

    Article  MATH  Google Scholar 

  33. P.J. Landin: A Correspondence Between ALGOL60 and Church’s Lambda-Notation. Comm. ACM, Vol. 8 (1965), No. 2, S. 89–101, No. 3, S. 158-165

    Article  MathSciNet  MATH  Google Scholar 

  34. P.J. Landin: The Mechanical Evaluation of Expressions. Computer Journal, Vol. 6 (1964), No. 4, S. 308–320

    MATH  Google Scholar 

  35. J. McCarthy: Recursive Functions of Symbolic Expression and Their Computation by Machine. Part 1, Comm. ACM, Vol. 3 (1960), No. 4, S. 184–195

    Article  MathSciNet  MATH  Google Scholar 

  36. R. Milner: A Proposal for Standard ML. University of Edinburgh, Dept. of Computer Science, Edinburgh, 1983

    Google Scholar 

  37. J. Moses: The Function of Function in LISP. MIT, AI Memo 199, Cambridge, 1970

    Google Scholar 

  38. J. Rees, W. Clinger (eds.): Revised3 Report on the Algorithmic Language Scheme. MIT AI Memo 848a, Cambridge, September 1986

    Google Scholar 

  39. G.E. Revesz: Lambda-Calculus, Combinators amd Functional Programming. Cambridge University Press, New York, 1987

    Google Scholar 

  40. J.C. Reynolds: Definitional Interpreters for Higher Order Programming Languages. ACM National Conference 1972, ACM, 1972, S. 717-740

    Google Scholar 

  41. J.C. Reynolds: Gedanken — A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept. Comm. ACM, Vol. 13 (1970), No. 5, S. 308–319

    Article  MathSciNet  MATH  Google Scholar 

  42. E. Sandewall: A Proposed Solution to the Funarg Problem. Uppsala, 1970

    Google Scholar 

  43. D. Scott: A System of Functional Abstraction. Handwritten Script, Stanford University, 1963

    Google Scholar 

  44. F. Simon: Lambda Calculus and LISP. Intitut f. Informatik, Christian-Albrechts-Universität Kiel, Bericht Nr. 8006, 1980

    Google Scholar 

  45. B.C. Smith: Reflection and Semantics in LISP. Proc. POPL 1984, ACM, S. 23-35

    Google Scholar 

  46. B.C. Smith, J. de Rivieres: 3-LISP Reference Manual. Version 1.03. CLI Stanford and Xerox Parc, Stanford and Palo Alto, 1984

    Google Scholar 

  47. B.C. Smith: Reflection and Semantics in a Procedural Language. MIT, Lab. for Computer Science, TR-272, Cambridge, 1982

    Google Scholar 

  48. C. Strachey: A General Purpose Macro System. Computer Journal, Vol. 8 (1965), No. 3, S. 225

    Article  MATH  Google Scholar 

  49. T.B. Steel (ed.): Formal Language Description Languages for Computer Programming. North Holland Publ., Amsterdam, 1966

    MATH  Google Scholar 

  50. G.L. Steele: Rabbit — A Compiler for Scheme. MIT, AI TR 472, Cambridge, 1978

    Google Scholar 

  51. G.L. Steele: Debunking the “Expensive Procedure Call” Myth. Proc. ACM National Conference 1977, ACM, 1977, S. 154-162 (MIT, AI Memo 443, Cambridge, 1977)

    Google Scholar 

  52. G.L. Steele: Lambda The Ultimate Declarative. MIT, AI Memo 379, Cambridge, 1976

    Google Scholar 

  53. G.L. Steele, G.J. Sussman: Lambda The Ultimate Imperative. MIT, AI Memo 353, Cambridge, 1976

    Google Scholar 

  54. H. Stoyan: Early LISP History (1956–1959). 1984 ACM Symp. on LISP and Functional Programming. ACM, New York, 1984, S. 299-310

    Google Scholar 

  55. H. Stoyan, G. Görz: LISP — Eine Einführung in die Programmierung. Springer, Berlin etc., 1984

    MATH  Google Scholar 

  56. G.J. Sussman, G.L. Steele: Scheme — An Interpreter for Extended Lambda Calculus. MIT, AI Memo 349, Cambridge, 1975

    Google Scholar 

  57. S.S. Thakkar (ed.): Selected Reprints on Dataflow and Reduction Architectures. The Computer Society, IEEE, Los Alamitos, 1987

    Google Scholar 

  58. D.A. Turner: Recursion Equations as a Programming Language. in J. Darlington, P. Henderson, D.A. Turner [12]

    Google Scholar 

  59. D.A. Turner: SALS Language Manual. University of St. Andrew, Dept. of Computational Science, Rep. CS/75/1, St. Andrew, 1975

    Google Scholar 

  60. J.E. Vuillemin: Proof Techniques for Recursive Programs. Stanford University, Dept. of Computer Science, STAN-CS-73-393, Stanford, 1973

    Google Scholar 

  61. P. Wegner: Introduction to Systems Programming. Academic Press, London etc., 1964

    Google Scholar 

  62. P. Wegner: Programming Languages, Information Structures, and Machine Organization. New York, 1968

    Google Scholar 

  63. J. Weizenbaum: The Funarg Problem Explained. MIT, Cambridge, 1968

    Google Scholar 

  64. P.M. Woodward: List Programming, in Fox [15]

    Google Scholar 

  65. M.G. Zilah-Szabo: APL lernen, verstehen, anwenden. Hanser, München, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informationswissenschaften, Universität Konstanz, Postfach 5560, 7750, Konstanz, Deutschland

    Herbert Stoyan

Authors
  1. Herbert Stoyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stoyan, H. (1988). Funktionale Programmierung — Der funktions-orientierte Programmierstil. In: Programmiermethoden der Künstlichen Intelligenz. Studienreihe Informatik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87954-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-87954-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19418-7

  • Online ISBN: 978-3-642-87954-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation