wenkokke / starchildLinks
F* library for verifying neural networks.
☆17Updated 2 years ago
Alternatives and similar repositories for starchild
Users that are interested in starchild are comparing it to the libraries listed below
Sorting:
- A style guide for Coq☆18Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months 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
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Updated this week
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- Tiny verified SAT-solver☆30Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Coq library for tactics, basic definitions, sets, maps☆51Updated 3 weeks ago
- 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
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Coq library on rewriting theory and termination☆37Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- Library for Classical Coq☆40Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Monadic effects and equational reasoning in Rocq☆73Updated 3 weeks ago
- Genetic program repair using GHC☆33Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago