Aloïs Cochard @alois@functional.cafe
Peace, Love and Referential Transparency.
"Philosophy, including Logic, is not primarily about language, but about the real world."
-- Arthur Prior
I left a base64 encoded message in the drawing I did in my niece "memories book".
So that's the drawing I got for my birthday ❤️
They lie when they say that software engineering is a nice field for those who aren't good at dealing with people. I spend just as much time writing code as fighting some people's enormous egos.
A serious attempt at providing automatic convertion from C code to Rust: c2rust.com
Here is a beautiful article describing an amazing piece of history... it also makes me finally understand why Monte Carlo is named liked that:
https://fas.org/sgp/othergov/doe/lanl/pubs/00326866.pdf
/ht @kmett@twitter.com
Interesting article that summarises my opinion on blockchain: https://hackernoon.com/ten-years-in-nobody-has-come-up-with-a-use-case-for-blockchain-ee98c180100
Nice to see that Wadler has collected the history of type class development on a single page on his website: http://homepages.inf.ed.ac.uk/wadler/topics/type-classes.html
Looks like it doesn't include instance chains/guards, though, so it must be only *his own* research on the topic.
A Peek Inside SAT Solvers - Jon Smock
"#SAT (and #SMT) #solvers have had much success in the #formal #methods communities. While #production solvers are large and highly engineered, the #concepts that made these tools practical are easy to understand. This talk takes a peek under the hood."
https://www.youtube.com/watch?v=d76e4hV1iJY
And, by the way,
"#Z3 is a #theorem #prover from #Microsoft #Research. It is licensed under the MIT license."
@alois
OTOH, the #Godwin's law as whole seems to be meaningless — any stream of text, if it isn't algorithmically generated, has exactly #probability 1 of finding any given word or phrase or generally a pattern "eventually".
If the law were quantitative, p(n) = …; n is natural, p is monotonic, p(0) = 0, and limit p(n) = 1 for n → ∞.
Godwin's rule of Open Source licensing:
"As an online discussion grows longer, the probability of a comparison involving Richard Stallman approaches 1"
This year's Utrecht Summer School on functional programming will run from 27-31 August. Check out the schedule, registration details, and further information on https://t.co/hk4nnAZIGJ
Do you know of any compiler that use the Sequent Calculus representation in the wild?
This looks like a useful alternative to lambda-calculus: https://www.microsoft.com/en-us/research/publication/sequent-calculus-as-a-compiler-intermediate-language/
« #SequentCalculus as a Compiler Intermediate Language »
« Thanks to the #CurryHoward isomorphism, terms of the #SequentCalculus can also be seen as a #ProgrammingLanguage with an emphasis on #ControlFlow. »
« Beside the point about simple grammar — for which it is hard to improve upon the elegance of the λ-calculus — #SequentCore manages to combine the advantages of both direct and continuation-passing styles. »
http://lambda-the-ultimate.org/node/5519
#Haskell
Convolutional Neural Networks over Tree Structures for Programming Language Processing.
https://arxiv.org/abs/1409.5718
Only classification of AST is treated here.
What represention could work as output?
That beautiful moment when after studying a field by re-implementing decades old papers, you reach a state where only yet-to-be published ones make you solve concrete implementation problems.
Proximal Policy Optimization Algorithms.
https://arxiv.org/abs/1707.06347
Looks like a reasonable and elegant solution to distribute DeepRL agents sampling.
Emergent complexity via multi-agent competition. (ICLR 2018)
https://arxiv.org/pdf/1710.03748.pdf
The Reduceron: High-Level Symbolic Computing on FPGA.
https://www.cs.york.ac.uk/fp/reduceron/ / https://github.com/tommythorn/Reduceron
Laziness with Representable Functors
https://medium.com/@drboolean/laziness-with-representable-functors-9bd506eae83f
Tl;dr
"We can convert any indexable data structure into its function form to achieve laziness. Formally, there’s an isomorphism from any Representable Functor to Reader. Gist is here: https://gist.github.com/DrBoolean/9b951c1c2cb225be9c289b0a2239132f"
Cochis: the Calculus Of CoHerent ImplicitS.
https://lirias.kuleuven.be/bitstream/123456789/582749/1/CW705.pdf by @PhilipWadler@twitter.com
"Faites des choses: passionnez-vous, lisez, apprenez. Faites des choses. On s'en fout quoi, ce que vous voulez mais faites des choses, arrêtez d'être passifs, faites des choses, passionnez-vous, bougez. On s'en fout si c'est pas dans la norme, on s'en fout si c'est pas startupeur, mais faites des trucs, faites des trucs vivants. Il n'y a rien de plus important, tout le reste passera. Faites des choses vivantes, ne soyez pas passifs face au monde, le monde est celui que vous faites."
