Talk:Pointfree programming

https://dl.acm.org/doi/pdf/10.1145/359576.359579

--> look at: 13.3.4 Cells, fetching, and storing.

Is this pointfree or not? --(this comment by Fpstefan at 17:43, 13 October 2025‎ UTC; please sign your comments with ~~~~)

Yes, FP is tacit. Specifically, FP is tacit in the same way that APL is tacit: there is only one form for expressions. However, like APL, FP does appear to support some binders.

For another example, consider Cammy. Cammy does not have nominal bindings, but it does have abstract bindings: typed holes which can be effectively bound through formal substitution. Are holes points? In Cammy, no, because Cammy follows category theory and holes are not points in category theory. (Holes are something nastier, from a so-called category of contexts. Don't worry about this unless you need dependent types!) Corbin (talk) 05:04, 14 October 2025 (UTC)