unnohideyuki / Tiger-in-Haskell

Related projects: ⓘ

• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆111Updated last week
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆80Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 10 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆121Updated last month
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 7 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆53Updated 3 years ago
• llvm-hs / llvm-hs-examples
  Examples for Haskell bindings to LLVM
  ☆70Updated 3 years ago
• frex-project / idris-frex
  ☆46Updated 5 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated last year
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆71Updated 4 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆64Updated 3 years ago
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆28Updated 5 years ago
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆63Updated 3 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆123Updated 9 years ago
• typedbyte / effet
  An effect system based on type classes, written in Haskell.
  ☆44Updated 2 years ago
• JeanHuguesdeRaigniac / effects-landscape
  Effects libraries in Haskell
  ☆73Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆55Updated 6 months ago
• eayus / sirdi
  Package manager for Idris
  ☆35Updated 2 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆56Updated 5 years ago
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆49Updated 11 months ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆144Updated 3 weeks ago
• Bodigrim / linear-builder
  Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.
  ☆88Updated last month
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆68Updated 5 years ago
• Bodigrim / bitvec
  Bit vectors: 8x less memory, up to 3500x faster than Vector Bool
  ☆73Updated 2 months ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆57Updated 5 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆80Updated last year
• ekmett / linear-logic
  They see me rollin'. They're Heyting. Patrollin' and tryna catch me ridin' dirty. -- Chamillionaire, 2005
  ☆82Updated 3 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago