A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
-
Updated
Dec 10, 2017 - Agda
A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
Bidirectional type checker for the simply typed lambda calculus
❄️ Simply typed lambda calculus formalized in Coq, REPL in Haskell.
SLConf 2024: 타입으로 안전하게 프로그래밍하기
Simply typed and advanced structures in lambda calculus
A repository dedicated to the derivation and implementation of type systems. Current system: Extended System F
Exercises and project for Programming Language Seminar course at ITU
Add a description, image, and links to the simply-typed-lambda-calculus topic page so that developers can more easily learn about it.
To associate your repository with the simply-typed-lambda-calculus topic, visit your repo's landing page and select "manage topics."