Wrote my first blog post and it is about a project I have been working on for many months!
The project is a rust library that makes it easy to use an sqlite database without any SQL knowledge.
https://blog.lucasholten.com/rust-query-announcement/
@jesper wow
@fasterthanlime why do you prefer codegen over proc macros? is it the build times?
@jesper die vond ik ook goed!
RustNL is proud to announce we will host the first "Rust All Hands" since 2018!
The All Hands is organized in close collaboration with the @rust project and with support of the Rust Foundation.
The "Rust All Hands" event is where all members of the Rust project come together in person to collaborate on the future of Rust. 🎉
The All Hands will be part of RustWeek 2025, in Utrecht, NL in May 2025.
https://blog.rust-lang.org/inside-rust/2024/09/02/all-hands.html
Viliam Vadocz and myself made a puzzle platformer programming game for the GMTK 2024 game jam. You can play it in the browser on itch! https://viliamvadocz.itch.io/gmtk-2024
Agda 2.7.0 release candidate 1
The Agda Team is pleased to announce a release candidate for Agda 2.7.0.
HighlightsMimer, a re-implementation of the “auto” term synthesizer, replaces Agsy.
New syntax using x ← e
to bind values on the left-hand-side of a function clause.
Instance search is more performant thanks to a new indexing structure. Additionally, users can now control how instances should be selected in the case multiple candidates exist.
User-facing options --exact-split
, --keep-pattern-variables
, and --postfix-projections
are now on by default.
Agda 2.7.0 RC 1 has been tested with GHC 9.10.1, GHC 9.8.2, GHC 9.6.6, 9.4.8, 9.2.8, 9.0.2, 8.10.7, 8.8.4 and 8.6.5 on Linux, macOS and Windows.
InstallationAgda 2.7.0 RC 1 can be installed using cabal-install or stack:
Getting the release candidate
$ cabal get
https://hackage.haskell.org/package/Agda-2.6.20240714/candidate/Agda-2.6.20240714.tar.gz
$ cd Agda-2.6.20240714
a. Using cabal-install
$ cabal install -f +optimise-heavily -f +enable-cluster-counting
$ stack --stack-yaml stack-a.b.c.yaml install --flag
Agda:optimise-heavily –flag Agda:enable-cluster-counting
replacing a.b.c
with your version of GHC (8.8.4 or higher).
The flags mean:
optimise-heavily: Turn on extra optimisation for a faster Agda. Takes large resources during compilation of Agda.
enable-cluster-counting: Enable unicode clusters for alignment in the LaTeX backend. Requires the ICU lib to be installed and known to pkg-config.
These flags can be dropped from the install if causing trouble.
Standard libraryYou can use the experimental
branch of the standard library with Agda 2.7.0. This branch is available at
https://github.com/agda/agda-stdlib/
Changes and fixed issues over Agda 2.6.4.3https://hackage.haskell.org/package/Agda-2.6.20240714/candidate/changelog
Enjoy the Agda 2.7.0 RC 1 and please test as much as possible. Report problems and regressions to: https://github.com/agda/agda/issues
Finally online now -- the Wasm Research Day version of my weval talk, on partial evaluation for JS compilation, from last month. Fairly improved compared to the version I gave earlier. Still working on shipping this soon!
https://www.youtube.com/watch?v=_T3s6-C38JI&list=PLTxJmWeyp02DAOQnK1wHTo6KmfVAvAkme&index=11
My PhD student Sára and I are looking for people to participate in a study on usability aspects of interactive theorem provers. Please consider signing up!
Who? anyone who uses or has used an interactive theorem prover for whatever purpose What? 90 - 120 minute interviews (possibly including a small think-aloud programming session) When? interviews will be scheduled starting September 2024 Where? online (participants from anywhere are welcome)
We are hoping these interviews will help us determine how you interact with your theorem provers and to gain insights on how we can improve the user experience. We are interested in all aspects of interactive theorem provers, including but not limited to their design, their tooling, their libraries, and their documentation.
Sign up here: https://tudelft.fra1.qualtrics.com/jfe/form/SV_0UJKuqcWC9G4FEy
"What about an AutoClone trait?", take 57:
https://smallcultfollowing.com/babysteps/blog/2024/06/21/claim-auto-and-otherwise/
`Clone` today communicates behavior, not intent. Having a third trait besides `Clone` and `Copy` would let us actually differentiate between `Arc::clone` and `BigStruct::clone` at a glance, and remove the ceremony of the former when it makes sense.
@jhpratt @theincredibleholk
Take a look at https://faultlore.com/blah/papers/thesis.pdf if you haven't yet.
There is also https://github.com/llogiq/compact_arena which I heard uses NLL to make unique lifetimes without a scope.
@yosh yes please