lambda-calculus
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.
A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
78 stars
7 watching
7 forks
Language: Coq
last commit: over 4 years ago Related projects:
Repository | Description | Stars |
---|---|---|
| A formalization of polymorphic lambda calculus with a proof of parametricity theorem. | 33 |
| Formalizations of functional languages with a focus on proof and verification | 142 |
| Reorganization of source code for dependently typed lambda calculus paper to improve readability and understandability | 112 |
| A collection of libraries providing essential components for building Java applications on the AWS Lambda platform. | 521 |
| A comprehensive Coq library providing formal definitions and proofs of rewriting theory, lambda-calculus, and termination. | 35 |
| A framework for building AWS Lambdas using dependency injection and aspect-oriented programming. | 16 |
| Implementing a graph-reduction machine for a small functional language based on λ-calculus and combinatory logic | 28 |
| An implementation of lambda calculus using interaction nets, providing a CLI and API. | 45 |
| An educational λ-calculus interpreter in Haskell to learn and understand λ-calculus concepts | 70 |
| Formalizations of logical deduction systems using Coq | 44 |
| Formalizes mathematics using the univalent point of view | 964 |
| A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| A formalization of geometry using the Coq proof assistant. | 186 |
| Formalization of a calculus for structured continuations in Coq | 36 |
| Provides an extension language for Coq to manipulate terms containing binders and supports scripting and metaprogramming | 141 |