kfl / ebpf-toolsLinks
Experiments with eBPF bytecode
☆15Updated 5 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:
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆16Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- CS410 "Advanced Functional Programming"☆28Updated 7 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A cost-aware logical framework, embedded in Agda.☆69Updated last month
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last month
- Formalizations of Gradually Typed Languages in Agda☆59Updated 2 weeks ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Meta-programming utilities for Agda.☆20Updated 4 months ago
- A verified compiler for a lazy functional language☆37Updated last week
- 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
- ☆29Updated 3 years ago
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Updated 4 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- ☆21Updated 3 years ago
- Formal specification of the Haskell Language Report☆29Updated this week
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago