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  5555 reads

Browse archives
Active forum topics 
Recent comments
16 weeks 9 hours ago
16 weeks 13 hours ago
16 weeks 13 hours ago
38 weeks 1 day ago
42 weeks 3 days ago
44 weeks 21 hours ago
44 weeks 21 hours ago
46 weeks 5 days ago
51 weeks 3 days ago
51 weeks 3 days ago