User loginNavigation 
"Very linear" lambda calculusWhat portion of linear lambda calculus corresponds to using only the B and I combinators (composition and identity)? I have a hunch that it's all lambda terms that use their input variables exactly once and without permuting them, but I'm finding it hard to prove that. The standard abstraction elimination algorithm doesn't work to give a combinator: \abcd.a(b(cd)) and to eliminate the variable "a" here, I need to use the C combinator. But there is a combinator that is extensionally equivalent that doesn't use C: \abcd.a(b(cd)) It depends on using the associativity of composition. How can I tell which linear terms are in the span of B and I? By mikestay at 20080917 17:57  LtU Forum  previous forum topic  next forum topic  other blogs  3572 reads

Browse archivesActive forum topics 
Recent comments
1 day 10 hours ago
1 day 16 hours ago
1 day 17 hours ago
2 days 4 hours ago
3 days 23 hours ago
5 days 6 hours ago
5 days 6 hours ago
1 week 3 hours ago
1 week 16 hours ago
1 week 3 days ago