polytypic / prettier-printer
A pretty printing library
☆24Updated 6 years ago
Alternatives and similar repositories for prettier-printer:
Users that are interested in prettier-printer are comparing it to the libraries listed below
- Formalism and proofs for esverify☆20Updated 6 years ago
- A partial implementation of Protocol Buffers in Idris☆31Updated 7 years ago
- High performance implementation of Immutable Sequence in JavaScript, based on Finger Tree.☆16Updated 9 years ago
- This is an attempt at painting as many bikesheds as possible with a typeclass hierarchy for idris reflecting "Algebra"☆18Updated 6 years ago
- Just-In-Time compiler for the OCaml byte-code runtime.☆32Updated 13 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- The rewrite of TLAPM, the TLAPS proof managerUpdated 5 years ago
- ot-coq☆17Updated last year
- Finger tree data structure for JavaScript☆26Updated this week
- Miscellaneous constructions on monoids☆18Updated last week
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- The language of the future!☆72Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- Recursion schemes in TypeScript (POC)☆22Updated 4 years ago
- A compiler from WebAssembly to native code, via the OCaml backend.☆91Updated 6 years ago
- Experimental model finder/SMT solver for functional programming.☆23Updated 2 years ago
- Fungi: Typed incremental computation with names☆67Updated 5 years ago
- SVG Combinators for Haskell☆23Updated 7 years ago
- Recursion schemes in ATS☆9Updated 3 years ago
- A type-safe dialect of TypeScript☆25Updated 10 years ago
- Implementation of "Sound and Complete Bidirectional Typechecking..." by Dunfield and Krishnaswami, POPL 2019☆11Updated 5 years ago
- An approach to user interfaces based in denotational design.☆27Updated 2 years ago
- My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.☆14Updated 5 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- BDD-based implementation of Datalog☆37Updated 4 years ago
- (Nominal) Adapton in OCaml☆54Updated 9 years ago
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Updated 5 years ago
- A two-dimensional parser combinator library.☆41Updated 7 years ago
- Standard library for the Formality language☆18Updated 5 years ago