Alternatives and similar repositories for Dependent-Binary-Lambda-Calculus:

Users that are interested in Dependent-Binary-Lambda-Calculus are comparing it to the libraries listed below

• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 3 months ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 2 months ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 5 months ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 5 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 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
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• seantalts / hasktrip
  Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.
  ☆23Updated 6 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• msp-strath / Mary
  Mary is the successor of Marx, a content delivery and assessment engine based on markdown and git
  ☆17Updated last year
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago
• ku-fpg / data-reify
  Reification of data structures using observable sharing
  ☆28Updated 5 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• cedille / cedille-cast
  Source files used for the Cedille Cast videos
  ☆12Updated 4 years ago
• gergoerdi / interaction-nets
  Haskell implementation of interaction net-based lambda evaluation
  ☆20Updated 8 years ago
• dmwit / pi-eta-epsilon
  An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"
  ☆23Updated 12 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 13 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆38Updated 9 months ago