User loginNavigation 
implementing byvalue reduction in lambda calculusGreetings, I am having trouble wrapping my head around byvalue substitution in lambda calculus. To try to warm up to lambda calculus I wrote a reducer, which works for leftmost outermost evaluation. However, when I tried to implement byvalue it seemed to work fine, accept in a situation where byvalue should have failed. Instead I get the same reduction as if I were using the leftoutermost substitution (which in this case should succeed). I am using the definition given in Sestoft, Peter's "Demonstrating Lambda Calculus Reduction." Given this occurrence of an error, I am led to the conclusion that either (1) I got lucky on leftoutermost reduction or (2) I am missing something on byvalue reduction. I would greatly appreciate any feedback or advice that this community can give. Sincerely, Jon By jdgallag at 20090228 21:23  LtU Forum  previous forum topic  next forum topic  other blogs  6010 reads

Browse archivesActive forum topics 
Recent comments
4 hours 57 min ago
6 hours 12 min ago
6 hours 21 min ago
7 hours 20 min ago
7 hours 38 min ago
10 hours 5 min ago
11 hours 33 min ago
13 hours 8 min ago
14 hours 48 min ago
1 day 46 min ago