Alternatives and similar repositories for ebpf-tools

Users that are interested in ebpf-tools are comparing it to the libraries listed below

• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated last month
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• msp-strath / cs410-advanced-functional-programming
  CS410 "Advanced Functional Programming"
  ☆28Updated 7 months ago
• ConcreteCactus / lcc
  A compiler that translates a form of lambda calculus to C
  ☆12Updated last year
• folivetti / srtree
  Haskell library for representing and manipulating Symbolic Regression Tree
  ☆16Updated this week
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated last year
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆63Updated last year
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated last month
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated 3 weeks ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆85Updated 9 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 8 months ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆62Updated 2 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 9 months ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆70Updated 2 months ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 8 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆20Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 4 months ago
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• tweag / pirouette
  Language-generic workbench for building static analysis
  ☆47Updated 2 years ago
• faulhornlabs / csip
  ☆24Updated 3 weeks ago
• jsiek / B522-PL-Foundations
  Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
  ☆55Updated 5 years ago