conal / talk-2023-galilean-revolution
A Galilean revolution for computing: Unboundedly scalable reliability and efficiency
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for talk-2023-galilean-revolution
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- ☆28Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Fine-grained lattice primitives for Haskell☆35Updated 3 months ago
- Haskell library for doing category theory with a central role for profunctors☆18Updated this week
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆19Updated 7 months ago
- NbE course @ Chalmers☆28Updated last month
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Reimplementation of a subset of Cabal☆23Updated this week
- A talk☆28Updated 3 years ago
- GHC-WPC is an extended GHC that exports the STG and other IR (.modpak) for the compiled modules and linker metadata (.ghc_stgapp) at appl…☆10Updated 8 months ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- A package re-exporting the verified subset of containers☆20Updated 6 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- GHC prof manipulation script☆30Updated 9 months ago
- An efficient graph library for Haskell☆39Updated 3 months ago
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- The Prettiest Printer☆35Updated 8 months ago
- Linear map categories in Agda☆5Updated last year
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆11Updated 3 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆33Updated 5 months ago
- Paper and talk☆45Updated last year
- Generic functions for single-sorted first-order structural unification☆41Updated last week
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Where my everyday research happens☆53Updated 2 months ago
- An experimental build system based on the Haxl library☆8Updated 5 years ago
- ☆25Updated 5 months ago