kfl / ebpf-toolsLinks
Experiments with eBPF bytecode
☆15Updated 6 months ago
Alternatives and similar repositories for ebpf-tools
Users that are interested in ebpf-tools are comparing it to the libraries listed below
Sorting:
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- CS410 "Advanced Functional Programming"☆30Updated this week
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 3 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆63Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated last week
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Agda category theory library for denotational design☆57Updated 2 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- An automated theorem prover for intuitionistic propostional logic☆14Updated 5 years ago
- Modern Compiler Implementation in ML, in Haskell☆22Updated 4 years ago
- Genetic program repair using GHC☆33Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Convert Haskell source code to Coq source code.☆93Updated 7 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 6 months ago
- Formal specification of the Haskell Language Report☆30Updated 2 weeks ago
- Interpret Haskell programs into any cartesian closed category.☆68Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 6 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- ☆16Updated last year
- ☆37Updated last year
- ☆13Updated last month