This is your work, valued
CanonicalExpression. Canonical expressions are a kind of binary expressions used especially in the implicative calculus of propositions
5DependentTypesForExtensiveGames. In this repository I present a Coq developement of extensive games using dependent types, together with examples
3CountingGeneratingAfffineLinearClosedLambdaterms. Haskell
2Lambda-R. Lambda calculus with explicit duplication and erasure (in Agda)
1DependentTypesForExtensiveGames-in-Agda. Agda
1CountingAndGeneratingClosuresAndEnvironments. Counting and generating Closure and Environments in lmabda calculus
1