llelf / icfp2020-papers

Related projects: ⓘ

• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆80Updated 2 years ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆110Updated 2 months ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 5 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated last year
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆121Updated last month
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆93Updated last year
• Gabriella439 / HasCal
  Haskell embedding of PlusCal
  ☆59Updated 2 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. Patrollin' and tryna catch me ridin' dirty. -- Chamillionaire, 2005
  ☆82Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated last year
• conal / linalg
  ☆42Updated this week
• 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
  ☆111Updated last week
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆64Updated 3 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆106Updated last year
• ekmett / cadenza
  every day i'm truffling
  ☆67Updated 3 years ago
• conal / denotational-hardware
  ☆85Updated this week
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆74Updated 6 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆55Updated 6 months ago
• OPLSS / introduction-to-algebraic-effects-and-handlers
  Introduction to algebraic effects and handlers
  ☆92Updated 6 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆55Updated 3 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆123Updated 9 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆86Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 10 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆66Updated last year
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆80Updated 3 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆51Updated 4 years ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆53Updated 10 months ago
• ocharles / effect-zoo
  Comparing Haskell effect systems for ergonomics and speed
  ☆65Updated 3 years ago