Lambda-Calculi implementations & proofs in Coq
-
Updated
Jun 5, 2022 - Coq
Lambda-Calculi implementations & proofs in Coq
A repository dedicated to the derivation and implementation of type systems. Current system: Extended System F
REPL for various lambda calculi.
SLConf 2024: 타입으로 안전하게 프로그래밍하기
Lambda Calculus implementations in OCaml.
Progamming language based on the system F-omega with polymorphic kinds, (weakly) equirecursive types, general function overloading, type inference, and flexible syntax.
Bidirectional type checking for predicative System F
A functional programming language based on system F (omega) ft. NbE and higher order unification
Lecture note on Lambda Calculus and Types for FLOLAC
My Attempt at System Fω with Row-Polymorphism
Formalization of the polymorphic lambda calculus and its parametricity theorem
A statically-typed strictly-evaluated garbage-collected readable programming language.
Language-generic workbench for building static analysis
An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
Add a description, image, and links to the system-f topic page so that developers can more easily learn about it.
To associate your repository with the system-f topic, visit your repo's landing page and select "manage topics."