iu-parfunc / gibbonLinks
A compiler for functional programs on serialized data
☆165Updated last month
Alternatives and similar repositories for gibbon
Users that are interested in gibbon are comparing it to the libraries listed below
Sorting:
- The Makam Metalanguage☆198Updated 2 years ago
- Dependent type checker using normalisation by evaluation☆263Updated 10 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Horn Clause Constraint Solving for Liquid Types☆150Updated last week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆148Updated last year
- Staged compilation with dependent types☆177Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Build system☆123Updated last year
- Alternative algorithm for algebraic subtyping.☆170Updated last month
- an implementation of stuck macros☆144Updated last month
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- The Twelf Programming Language☆140Updated 5 months ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆148Updated 3 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- 1ML prototype interpreter☆285Updated 5 years ago
- Prototype type inference engine☆203Updated 6 months ago
- Spartan type theory☆270Updated last year
- 😎TT☆231Updated last year
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Coq formalizations of functional languages.☆145Updated 5 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago