A SuperCompiler for Martin-Löf's Type Theory
-
Updated
Jan 29, 2022 - Scala
A SuperCompiler for Martin-Löf's Type Theory
Towards changing things and see if it proofs
SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory
Stainless directly built on System FR, with standalone front-end
TyES (Type Experiment System) is a personal project in the area of type systems, aiming to provide a playground to test different type system ideas in a simple way.
Example code to accompany shapeless-guide.
Work-in-progess statically-typed, functional programming language made using Scala
Add a description, image, and links to the type-theory topic page so that developers can more easily learn about it.
To associate your repository with the type-theory topic, visit your repo's landing page and select "manage topics."