pi8027 / efficient-finfunLinks
☆13Updated 6 years ago
Alternatives and similar repositories for efficient-finfun
Users that are interested in efficient-finfun are comparing it to the libraries listed below
Sorting:
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Tactic for polynomial manipulations☆12Updated 7 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- ☆18Updated last month
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated 2 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- ☆18Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Quasi-quoting library for agda☆18Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- Lenses in Coq☆17Updated 3 years ago
- haha I'm graduating☆14Updated 4 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago