Forwarded from Hacker News
Ghostty 1.0 (🔥 Score: 153+ in 45 minutes)
Link: https://readhacker.news/s/6k7S9
Comments: https://readhacker.news/c/6k7S9
Link: https://readhacker.news/s/6k7S9
Comments: https://readhacker.news/c/6k7S9
Ghostty
Ghostty is a fast, feature-rich, and cross-platform terminal emulator that uses platform-native UI and GPU acceleration.
MetaOCaml: Ten Years Later
Oleg
https://okmij.org/ftp/meta-programming/design-10.pdf
https://okmij.org/ftp/ML/MetaOCaml.html#design-10
Oleg
https://okmij.org/ftp/meta-programming/design-10.pdf
https://okmij.org/ftp/ML/MetaOCaml.html#design-10
You could have invented Fenwick trees
B. Yorgey
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/you-could-have-invented-fenwick-trees/B4628279D4E54229CED97249E96F721D
B. Yorgey
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/you-could-have-invented-fenwick-trees/B4628279D4E54229CED97249E96F721D
Cambridge Core
You could have invented Fenwick trees | Journal of Functional Programming | Cambridge Core
You could have invented Fenwick trees - Volume 35
Forwarded from AlexTCH
https://vezwork.github.io/drostes-lair-post/
A cute cool project. If you don't understand recursion, this can help immensely. Also if you don't know what the
If you already know all that, it's just a fun game. 😊
A cute cool project. If you don't understand recursion, this can help immensely. Also if you don't know what the
amb
is, you can and should learn.If you already know all that, it's just a fun game. 😊
vezwork.github.io
An invitation into Droste's Lair
A swords-and-sorcery programming environment for building and counting mathematical structures
Eratosthenes again.
Turner, Bird, Eratosthenes: An eternal burning thread
by J. Gibbons
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/turner-bird-eratosthenes-an-eternal-burning-thread/32E2EDF5D5EAEC95F13D313BC97B86F0
Turner, Bird, Eratosthenes: An eternal burning thread
by J. Gibbons
https://www.cambridge.org/core/journals/journal-of-functional-programming/article/turner-bird-eratosthenes-an-eternal-burning-thread/32E2EDF5D5EAEC95F13D313BC97B86F0
Cambridge Core
Turner, Bird, Eratosthenes: An eternal burning thread | Journal of Functional Programming | Cambridge Core
Turner, Bird, Eratosthenes: An eternal burning thread - Volume 35
Learn Programming with OCaml
by Sylvain Conchon and Jean-Christophe Filliâtre, 2025
https://usr.lmf.cnrs.fr/lpo/
by Sylvain Conchon and Jean-Christophe Filliâtre, 2025
https://usr.lmf.cnrs.fr/lpo/
usr.lmf.cnrs.fr
Learn Programming with OCaml
Forwarded from AlexTCH
https://calculatingempires.net/
A fascinating visualization (a timeline) of the development of communication, data management, computing, education, medicine, economy, energy, policy, surveillance, military and so on from 1500 till today across the world.
I'm not sure it's 100% historically accurate, but still illuminating.
A fascinating visualization (a timeline) of the development of communication, data management, computing, education, medicine, economy, energy, policy, surveillance, military and so on from 1500 till today across the world.
I'm not sure it's 100% historically accurate, but still illuminating.
calculatingempires.net
Calculating Empires: A Genealogy of Technology and Power since 1500
Explore how technical and social structures co-evolved over five centuries in this large-scale research visualization.
Forwarded from AlexTCH
https://www.youtube.com/watch?v=CVLSA8YGvM8
https://catcolab.org (https://github.com/ToposInstitute/CatColab)
This is mind-blowing! 🤯
A collaborative (as in Google Docs) notebook for defining and simulating a range of "logic"/diagram notations starting with purely descriptive ontologies and up to quantitative stock-and-flow diagrams (which define a system of differential equations).
Implemented in Rust and TypeScript offloading the heavy-lifting of actual processing to AlgebraicJulia and Julia's differential equations ecosystem. All based on Double Category Theory.
https://catcolab.org (https://github.com/ToposInstitute/CatColab)
This is mind-blowing! 🤯
A collaborative (as in Google Docs) notebook for defining and simulating a range of "logic"/diagram notations starting with purely descriptive ontologies and up to quantitative stock-and-flow diagrams (which define a system of differential equations).
Implemented in Rust and TypeScript offloading the heavy-lifting of actual processing to AlgebraicJulia and Julia's differential equations ecosystem. All based on Double Category Theory.
YouTube
A quick intro to CatColab
A tour of some of the current features of CatColab, as of the recent release of version 0.2: Wren.
The models discussed here are available at this page: https://catcolab.org/help/quick-intro
The models discussed here are available at this page: https://catcolab.org/help/quick-intro
Termination Combinators Forever
Maximilian Bolingbroke, Simon Peyton Jones, Dimitrios Vytiniotis
We describe a library-based approach to constructing termination tests suitable for controlling termination of symbolic methods such as partial evaluation, supercompilation and theorem proving. With our combinators, all termination tests are correct by construction. We show how the library can be designed to embody various optimisations of the termination tests, which the user of the library takes advantage of entirely transparently.
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/termination-combinators.pdf
Maximilian Bolingbroke, Simon Peyton Jones, Dimitrios Vytiniotis
We describe a library-based approach to constructing termination tests suitable for controlling termination of symbolic methods such as partial evaluation, supercompilation and theorem proving. With our combinators, all termination tests are correct by construction. We show how the library can be designed to embody various optimisations of the termination tests, which the user of the library takes advantage of entirely transparently.
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/termination-combinators.pdf
Forwarded from AlexTCH
https://www.pm.inf.ethz.ch/research/verifythis.html
Another VerifyThis Competition is coming May 3rd and 4th, 2025.
Online participants are welcome: https://docs.google.com/forms/d/e/1FAIpQLScOhK5tMG5q5DMb36yrTQ8itUwvJ2EN8IG_kgjsX6HQZ6dDhw/viewform
The use of AI-based tools is allowed.
Another VerifyThis Competition is coming May 3rd and 4th, 2025.
Online participants are welcome: https://docs.google.com/forms/d/e/1FAIpQLScOhK5tMG5q5DMb36yrTQ8itUwvJ2EN8IG_kgjsX6HQZ6dDhw/viewform
The use of AI-based tools is allowed.
Programming Methodology Group
VerifyThis Competition
2025 edition at ETAPS 2025 in Hamilton, Canada