Category:Programming paradigm/Tacit: Difference between revisions

Content added Content deleted

Inline

Revision as of 12:55, 3 January 2024

This page is a stub. It needs more information! You can help Rosetta Code by filling it in!

Tacit programming, also called point-free style, is a programming style in which function definitions refer implicitly (i.e. not by name) to arguments (or "points") on which they operate. They compose other functions, among which are combinators that manipulate the arguments.

Subcategories

This category has the following 4 subcategories, out of 4 total.

B

BQN‎ (1 C, 273 P)

J

J‎ (3 C, 1,413 P)
Jq‎ (2 C, 1,158 P)

L

Lang5‎ (49 P)

@@ Line 1: / Line 1: @@
 {{stub}}{{feature|Programming paradigm}}
+Tacit programming, also called point-free style, is a programming style in which function definitions refer implicitly (i.e. not by name) to arguments (or "points") on which they operate. They compose other functions, among which are combinators that manipulate the arguments.
-Tacit programming is programming where the arguments are state-free and are not explicitly referenced.
-(For comparison purposes: arguments typically are not explicitly referenced in stack based languages -- however, in most stack based languages arguments are stateful, in the sense that you need to access them differently after every push or pop or whatever.)
 See also:
@@ Line 8: / Line 6: @@
 * [https://aplwiki.com/wiki/Tacit_programming Tacit programming] - APL Wiki
 * [https://en.wikipedia.org/wiki/Tacit_programming Tacit programming] - Wikipedia
+References:
+* John Backus. 1978. ''Can programming be liberated from the von Neumann style? A functional style and its algebra of programs''. Commun. ACM 21, 8 (Aug. 1978), 613–641. https://doi.org/10.1145/359576.359579
+* Henry G. Baker. 1994. ''Linear logic and permutation stacks—the Forth shall be first''. SIGARCH Comput. Archit. News 22, 1 (March 1994), 34–43. https://doi.org/10.1145/181993.181999