A toy type checker (mirrored from https://gitlab.com/ilankri/lambda)
-
Updated
Apr 15, 2022 - OCaml
A toy type checker (mirrored from https://gitlab.com/ilankri/lambda)
Functional language with type inference and let-polymorphism
Example implementation of the Hindley-Milner type system
A functional programming language based on system F (omega) ft. NbE and higher order unification
Implementation of Algorithm W
Type inference implementation in OCaml using Algorithm W
A simple library implementation of binary sessions
A type reconstruction algorithm implementation for the implicitly and gradually typed language with shift and reset
Interpreter of the ITGL with runtime type inference
OCaml implementation of a constraint-based bottom-up type inference algorithm
Esca is an experimental strongly-typed language which compiles to Go.
A minim(a)l subset of OCaml, with type inference
Type checking, type inference, Church, Curry, polymorphe types, Unification theory, ... All type theory related
A programming language with first-class modules and algebraic effects.
Implementation of the lambda calculus
Playing with type systems
Luna is a general purpose language
A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a static type system with inference of types and effects, with subtyping.
Add a description, image, and links to the type-inference topic page so that developers can more easily learn about it.
To associate your repository with the type-inference topic, visit your repo's landing page and select "manage topics."