system-F
by Lysxia
Formalization of the polymorphic lambda calculus and its parametricity theorem
AI summary
Lambda calculus formalization
A formalization of polymorphic lambda calculus with a proof of parametricity theorem.
- stars
- 33
- forks
- 2
- watching
- 4
Similar projects
Found by comparing what the projects do, not just their names.
Lambda calculus framework
A formalization of typed and untyped lambda calculus in Coq and Agda2, aiming to provide a rigorous foundation for understanding the properties of these systems.
Functional language formalization
Formalizations of functional languages with a focus on proof and verification
Formalism library
A comprehensive Coq library providing formal definitions and proofs of rewriting theory, lambda-calculus, and termination.
Type theory library
An implementation of System F type theory with parametricity models in Coq
Formal language system
An implementation of System F in Coq, aiming to provide a rigorous and expressive formal system for describing programming languages.
Logical Deduction Library
Formalizations of logical deduction systems using Coq
λ-calculus compiler
Implementing a graph-reduction machine for a small functional language based on λ-calculus and combinatory logic
Category theory formalization
An implementation of category theory in the Coq proof assistant.
Parametrization tool
A Coq plugin providing commands for generating parametricity statements used in data refinement proofs.
Formal math proofs
A personal repository of formally verified mathematics using the Coq proof assistant
Algebra library
A Coq formalization of abstract algebra using functional programming style
Type verification library
Mechanized formalization of soundness for DOT with logical relations in Coq
Formal Proof Lecture
An introductory course on floating-point numbers and formal proof using Coq
Lambda calculator
Reorganization of source code for dependently typed lambda calculus paper to improve readability and understandability
