FFP(ID:758/ffp001)
Formal FP
- Country: us
- Began: 1977
- Published: 1977
Formal FP. Similar to FP, but with regular sugarless syntax, for machine execution.
Related languages
| FP |
=> |
FFP | |
Evolution of |
| FFP |
=> |
FFP with streams | |
Extension of |
References:
Backus, John "Can programming be liberated from the von Neumann style? A functional style and its algebra of programs" (1977 Turing Award Lecture) view details
in [ACM] CACM 21(08) (August 1978). view details
Ida Tetsuo, Tanaka Jiro "Early experiences with functional programming languages: FP and FEL both in implementation and programming" view details
in IPSJ SIGNotes SYMbol manipulation Abstract No.023 - 005 view details
Ida Tetsuo, Tanaka Jiro "Functional programming with streams" view details
Abstract: The advantage of programming paradigm to be called "stream programming" is discussed. The expressive power and conceptual clarity of stream programming derive from the fact that a stream is formulated as a natural extension of iterations as opposed to lazy evaluation approach. Streams are embedded in a functional programming system FFP. This permits clear and efficient treatment of streams. A set of primitive functions for stream programming are given and some examples are shown. The outline of the implementation of the primitives are also given.
in IPSJ SIGNotes Software Foundation Abstract No.003 - 008 view details
|