iwilare / formal-methodsLinks
Operational semantics, Type-based information flow security, Hoare logic, Verification conditions, and Separation logic in Agda for the IMP language
☆18Updated 2 years ago
Alternatives and similar repositories for formal-methods
Users that are interested in formal-methods are comparing it to the libraries listed below
Sorting:
- ☆47Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A TACtic library for Agda☆48Updated 9 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Meta-programming utilities for Agda.☆19Updated this week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- Revised Omega-categorical Typechecker☆26Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated 2 months ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- ☆23Updated 11 months ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- ☆36Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated this week
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- Constructive Galois connections☆32Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Monadic effects and equational reasoning in Rocq☆72Updated this week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 7 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago