bollu / timi
A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages
☆68Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for timi
- Hindley-Milner type inference using constraints☆50Updated 7 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆50Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆92Updated 2 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆51Updated 7 years ago
- ☆36Updated 6 years ago
- Book: Introduction to Dependent Types with Idris☆76Updated last year
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆45Updated 8 years ago
- LaTeX sources for the Habit Programming Language Report☆24Updated 6 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆77Updated 2 years ago
- ☆89Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆52Updated 6 months ago
- type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc☆31Updated 4 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆110Updated 5 years ago
- A prototype programming language for programming with runners☆88Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Abstract binding tree code generator☆36Updated 8 years ago
- Fork of official GHC repository.☆44Updated 9 months ago
- WebAssembly Code Generation Backend for Idris Compiler☆84Updated 6 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Automagical variable binding library for Rust☆67Updated 5 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Fungi: Typed incremental computation with names☆66Updated 5 years ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆57Updated 3 years ago
- Macros have types!☆130Updated last year