Skip to content

calin1304/relative-monads-lean

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

Repository files navigation

Formalizing relative moands with Lean

This is an implementation of well-scoped lambda calculus terms using Lean, where variables are represented as de Bruijn indices and each term has its context size encoded at the type level. The implementation is presented from the perspective of relative monads, showing that well-scoped lambda calculus terms are an instance of a relative monad of a functor from the category of contexts to the category of sets.

The main inspiration for this work is Altenkirch, T., Chapman, J., & Uustalu, T. (2014). Relative Monads Formalised. Journal of Formalized Reasoning, 7(1), 1–43. https://doi.org/10.6092/issn.1972-5787/4389.

About

Formalization of relative monads with application to untyped lambda calculus using Lean

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages