Alternatives and similar repositories for polyrpc

Users that are interested in polyrpc are comparing it to the libraries listed below

• kowainik / first-class-patterns
  First class patterns and pattern matching, using type families
  ☆17Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• kowainik / trial
  ⚖️ Trial Data Type
  ☆21Updated last month
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated 3 months ago
• robrix / tilec
  Sometimes when I feel sad I implement a dependently typed lambda calculus.
  ☆15Updated 5 years ago
• wenkokke / priority-sesh
  Session Types with Priority in Linear Haskell
  ☆27Updated last year
• lortabac / ariel
  A simple, purely-functional programming language
  ☆25Updated 3 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated last month
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• ekmett / parsnip
  ☆18Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• kframework / haskell-core-semantics
  Haskell's Core in K.
  ☆20Updated 8 years ago
• TOTBWF / teenytt
  A Teeny Type Theory
  ☆26Updated 3 years ago
• xnning / dependent-types-in-haskell
  Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup
  ☆16Updated 6 years ago
• i-am-tom / dagless
  A monadic interface for DAG construction.
  ☆24Updated 4 years ago
• lukeg101 / lplzoo
  Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
  ☆36Updated 4 years ago
• ChrisPenner / recursive-zipper
  Zippers for cofree types
  ☆12Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 7 months ago
• 5outh / Molecule
  A tiny statically typed programming language
  ☆18Updated 10 years ago
• Kleidukos / Intrigue
  My attempt at writing a R⁵RS-compliant Scheme with Megaparsec
  ☆14Updated last year
• wrengr / bytestring-trie
  An efficient finite map from (byte)strings to values.
  ☆20Updated 2 months ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• ollef / dependent-hashmap
  Dependent hash maps
  ☆14Updated 3 months ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• grin-compiler / ext-stg-interpreter-presentation-demos
  ☆16Updated 3 years ago
• kwanghoon / bidi
  bidirectional type checking algorithms for higher-ranked polymorphism
  ☆19Updated 3 years ago