lexi-lambda / higher-rank

Related projects ⓘ

Alternatives and complementary repositories for higher-rank

• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆59Updated last year
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆76Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆129Updated 4 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆95Updated 7 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 4 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆119Updated 2 months ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 4 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆157Updated 6 months ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 5 years ago
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆122Updated 3 months ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆93Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 10 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆57Updated 5 years ago
• aneksteind / Core
  compile your own functional language
  ☆36Updated 5 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 3 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 6 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated 2 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• agda / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆103Updated 7 years ago
• int-index / ether
  Monad Transformers and Classes
  ☆78Updated 5 years ago
• rampion / constraint-unions
  A syntax for unions of constraints in Haskell
  ☆70Updated 7 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 7 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• dorchard / effect-monad
  Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
  ☆99Updated last year