Alternatives and similar repositories for Intensional-computation:

Users that are interested in Intensional-computation are comparing it to the libraries listed below

• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 2 months ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• phadej / idioms-plugins
  Hack idiom-brackets using GHC Source Plugin (8.6+)
  ☆25Updated 6 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 6 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated last year
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 5 months ago
• alhassy / multistage-programming-taha
  A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''
  ☆10Updated 6 years ago
• lexi-lambda / mini-ml
  An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)
  ☆21Updated 6 years ago
• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 4 months ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• wenkokke / chez-scheme-hs
  Haskell bindings to Chez Scheme
  ☆10Updated last year
• LightAndLight / closure
  Closure calculus implementation
  ☆12Updated 5 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• fsestini / tt-in-cubical
  Type Theory in Type Theory using Cubical Agda
  ☆12Updated 6 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• clayrat / idris-linear
  Experiments with linear types
  ☆14Updated 7 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• kowainik / idris-patricia
  🌋 Idris implementation of patricia tree
  ☆22Updated 4 years ago