Difference between revisions of "Function"
| Line 1: | Line 1: | ||
Functions are abstract mathematical representation of [[relation]]s between the [[domain]] and [[codomain]]. It can be represented as a [[key-value pairs]], or in the [[lambda calculus]] form. | Functions are abstract mathematical representation of [[relation]]s between the [[domain]] and [[codomain]]. It can be represented as a [[key-value pairs]], or in the [[lambda calculus]]<ref>{{:BOOK/Structure and Interpretation of Computer Programs}}</ref> form. | ||
Function can be used as a generic building block to represent information in general. It can be thought of as a primitive kind of data structure. This argument can be substantiated by thinking of [[Lambda calculus]] as a generalized way of encoding functions in an explicit structured [[data]] format. | Function can be used as a generic building block to represent information in general. It can be thought of as a primitive kind of data structure. This argument can be substantiated by thinking of [[Lambda calculus]] as a generalized way of encoding functions in an explicit structured [[data]] format. | ||
Revision as of 08:40, 25 July 2021
Functions are abstract mathematical representation of relations between the domain and codomain. It can be represented as a key-value pairs, or in the lambda calculus[1] form.
Function can be used as a generic building block to represent information in general. It can be thought of as a primitive kind of data structure. This argument can be substantiated by thinking of Lambda calculus as a generalized way of encoding functions in an explicit structured data format.
Design Principle
PKC is designed with this idea in mind, that function is a kind of data, and can be recursively referenced to perform both computation and carry computational results. By thinking about this design principle at all times, all pages in PKC will be constructed and decomposed based on a functional style, a style that has a name, as the head of a function, and many key-value-pairs as its arguments. Thinking about functions at all times in this primitive, yet generic construct, allows users to think of all functions as hyperlinks or fiber bundles that relates objects from one to the other, revealing the topological structures, or the systematic structures of anything. Most importantly, users of PKC can think of writing down notes in various pages are effectively construction functions or conducting computational work in parallel and in an explicit functionally designed data storage.
References
- ↑ Abelson, Harold; Sussman, Gerald; Sussman, Julie (1985). Structure and Interpretation of Computer Programs (2nd ed.). local page: MIT Press. ISBN 0-262-51087-1.