Cited in
(16)- A dependent type theory with abstractable names
- An initial algebra approach to term rewriting systems with variable binders
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
- Gmeta
- RepLib
- LOIS
- HNT
- NLambda
- Unbound
- FreshML
- The representational adequacy of Hybrid
- Binders unbound
- Free functor from the category of G-nominal sets to that of 01-G-nominal sets
- Fast computations on ordered nominal sets
- Simple and subdirectly irreducible finitely supported \(Cb\)-sets
- Ons
This page was built for software: FreshOCaml
