Alternatives and similar repositories for tilec

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

• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 3 months ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• LightAndLight / closure
  Closure calculus implementation
  ☆12Updated 5 years ago
• ollef / dependent-hashmap
  Dependent hash maps
  ☆14Updated 2 months ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• glaebhoerl / simplecompiler
  used to be something more ambitious, cut scope to just a simple compiler for thesis project
  ☆17Updated 6 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• robrix / Manifold
  Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.
  ☆18Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 5 months ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• ku-fpg / data-reify
  Reification of data structures using observable sharing
  ☆29Updated 7 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 7 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated last year
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• tfausak / monadoc-5
  🔖 Better Haskell documentation.
  ☆17Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• i-am-tom / dagless
  A monadic interface for DAG construction.
  ☆24Updated 4 years ago