Function Composition in Programming Languages - Conor Hoekstra - CppNorth 2023
ฝัง
- เผยแพร่เมื่อ 28 ก.ย. 2024
- www.cppnorth.ca
---
Function Composition in Programming Languages - Conor Hoekstra - CppNorth 2023
Most people think of function composition as composing two unary functions together (the B combinator). However, this is only the tip of the proverbial "function composition" iceberg. This talk will be both an introduction and an overview of the world of combinatory logic and combinators. If you have ever wondered what the S, Phi, Psi, or B1 combinators are and why they are so useful, this is the talk for you. And even if you have never wondered that - I promise this talk will be worth your time. It will expand the limits of what you thought was possible with programming languages and give you the tools and knowledge to use combinators in your choice of programming language.
---
Slides: github.com/Cpp...
Sponsored By:
think-cell: www.think-cell...
JetBrains: www.jetbrains....
---
Conor Hoekstra
Conor (he/him) is a Research Scientist at NVIDIA working on array programming models and languages. He is extremely passionate about programming languages, algorithms and beautiful code. He is the founder and organizer of the Programming Languages Virtual Meetup, he has a TH-cam channel and is the host of two podcasts:
ADSP: Algorithms + Data Structure = Programs
ArrayCast
Conor is also an avid conference speaker. You can find all of Conor's conference talks and podcast appearances (on other podcasts) here github.com/cod...
---
CppNorth is an annual C++ conference held in Toronto, Canada.
- Annual CppNorth C++ conference: cppnorth.ca/
- CppNorth Twitter: / cppnorth
---
TH-cam Videos Edited & Optimised by Digital Medium: events.digital...
#cppnorth #cpp #programminglanguages
great talk. thanks
Amazing!
Although the subject matter by itself may not draw much interest, your enthusiasm for it certainly does.
51:03 I think contemporary c++ devs can think or appreciate “point free” because it typically corresponds to composing chains of operations in the same manner that std::ranges::views can be composed using the pipe operator
Moses Schönfinkel birth date is 1888 not 1988.(typo)
12:00, *1888.
15:34, what?! Do you know any other kind of software they are willing to pay millions?
38:30, to map true/false keeping their positions/indexes. If that's not required, std::partition puts all trues at the beginning, returning a pointer to where they finish and to where the falses start. And std::stable_partition, despite obviously not keeping their indexes, keep their positions related to each other, at each group.
56:00, auto sum_of_squares (std::vector nums) {return std::accumulate (nums.begin(), nums.end(), 0, [](auto x, auto i) {return !(nums.size() % i)*x*x;});}
18:58 Futhark should be an array language, no?
46:50 does readability count?
The definition of pure function and distinction isn't really correct. A combinator is a pure function that is not a closure, that's it.
That fromEnum solution is absolutely awful and haskell does have a count function... Not like you couldn't have defined it yourself
Regarding the light/dark mode change and comment at 46:30, it's worth noting that presentations given in dark mode are generally less visible than those in light mode. In the live room, any ambient light can wash out the "dim" image. And for TH-cam viewers in bright environments (such as outside or by a window), the same is true. In contrast (no pun intended), light mode content can always be dimmed at the display device. So those late night viewers can just turn their screen brightness down. Unless you know your current and future audience will be in low light environments, Light Mode is the safe choice.
With all humility, not wishing to imply that I have his greatness (or indeed anything more than glints of occasional competence)... Late in his career, Neil Peart took drum lessons -- in jazz. So it might also be for me, coming from a procedural/object-based background (heavy on the former), as I take the plunge into functional /combinatorial. I find it all very intriguing. Thanks to Conor and everyone for the talks.
Is map a combinator? Is bind a combinator?
Futhark sample:
let SumOfSquares a = map2 (\x i -> if length a % (i+1) == 0 then x*x else 0) a (indices a) |> reduce_comm (+) 0
This isn't point free but does use three different combinators. |> could be replaced by reordering with parenthesis, but the map-reduce array combinators are the expected way to handle arrays. The filter was avoided using a neutral element, because realizing the filtered list could cause multiple heavier passes.
8:40 they did not fix it in post
:o 🎉