Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
the assignment statement as the bottleneck, and programs combined algebraically
Read it
EnglishTiếng Việt (abstract only)中文 (abstract only)日本語 (abstract only)
English beside Tiếng ViệtEnglish beside 中文English beside 日本語
- 19 sections
- 0 figures
- 0 equations
- 23 references
- cited by 0 here
- difficulty 3 of 5
- the publisher's page
Contents
- Introduction
- 1Conventional Programming Languages: Fat and Flabby
- 2Models of Computing Systems
- 3Von Neumann Computers
- 4Von Neumann Languages
- 5Comparison of von Neumann and Functional Programs
- 6Language Frameworks versus Changeable Parts
- 7Changeable Parts and Combining Forms
- 8APL versus Word-at-a-Time Programming
- 9Von Neumann Languages Lack Useful Mathematical Properties
- 10What Are the Alternatives to von Neumann Languages?
- 11Functional Programming Systems (FP Systems)
- 12The Algebra of Programs for FP Systems
- 13Formal Systems for Functional Programming (FFP Systems)
- 14Applicative State Transition Systems (AST Systems)
- 15Remarks About Computer Design
- 16Summary