Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring
☆27Apr 29, 2021Updated 4 years ago
Alternatives and similar repositories for reprinter
Users that are interested in reprinter are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Template for Hindley-Milner based languages☆39Dec 7, 2021Updated 4 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- freer monads and cofreer comonads.☆23Jun 26, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Code for the submitted TyDe '16 extended abstract and C∘mp∘se '17 talk "`choose` Your Own Derivative"☆19May 18, 2017Updated 8 years ago
- Regular expression matching in Idris☆11Apr 27, 2016Updated 9 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Comparing Different Stochastic Gradien Descent implementations in Haskell against Python☆10Jul 25, 2016Updated 9 years ago
- Using Backpack to abstract over the main Haskell streaming libraries.☆34Sep 16, 2017Updated 8 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Monad transformers for combining local and global state with backtracking/backjumping/continuations☆20Jul 23, 2016Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Various type-aligned sequence data structures.☆21Aug 15, 2021Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Working through Okasaki's "Functional Datastructures" in PureScript☆14Nov 9, 2016Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 10 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Nat, Fin, Vec☆25May 2, 2025Updated 10 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Talk on generic parallel scan☆14May 12, 2017Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆27Mar 28, 2025Updated 11 months ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Aug 16, 2020Updated 5 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Spacemacs Layer for LiquidHaskell☆13Jun 10, 2017Updated 8 years ago
- Invertible syntax for Scala.☆13Oct 17, 2016Updated 9 years ago