AshleyYakeley / Truth
Changes and Pinafore projects. Pull requests not accepted.
☆32Updated this week
Related projects ⓘ
Alternatives and complementary repositories for Truth
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆52Updated 6 months ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated last month
- ☆39Updated 3 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 4 months ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆65Updated 9 months ago
- a functional programming language with algebraic effects and handlers☆81Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- source code for the bondi programming language☆38Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆33Updated 6 months ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 5 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- dependently-typed lisp with flexible compiler backends☆25Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Efficient parser combinators for Haskell☆39Updated 6 months ago
- Setoid type theory implementation☆38Updated last year
- ☆12Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆30Updated 3 months ago
- ICFP tutorial☆40Updated 3 years ago
- A WIP little dependently-typed systems language☆37Updated 2 months ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 4 years ago