User loginNavigation 
Weird computability problem relating to state + lambda calculusHi all, I've been reading about lambda calculus, specifically the different augmentations of lambda calculus. The ones that most interest me are the ones with some sort of state, like a store (mu). So my question is: Given a term, t, in the (untyped) lambda calculus (or in a typed calculus which features full abstraction), is it decidable whether or not it ever modifies the state (updates some value in the store, etc). My gut says that it's not decidable for all terms, but I want to PROVE it. Kevin By ellisk at 20090116 22:12  LtU Forum  previous forum topic  next forum topic  other blogs  4324 reads

Browse archivesActive forum topics 
Recent comments
1 day 21 hours ago
2 days 3 hours ago
2 days 5 hours ago
2 days 15 hours ago
4 days 11 hours ago
5 days 18 hours ago
5 days 18 hours ago
1 week 15 hours ago
1 week 1 day ago
1 week 4 days ago