User loginNavigation |
A question I have been meaning to ask.The Lambda calculus is a logical language and so are derivations such as lisp, scheme, and other functional languages. As such they theoretically could be used to prove facts as in languages like Prolog but I have never seen this done. Moreover there is an intuitionistic logic (could this also be the more classic synthetic logic??) which could be quite useful for dealing with "real" dynamic, or uncertain environments. Something that could be very useful. Yet I am not awair of any practical tools for this. Might not the logical interpretation of a function be more clear if the functions were written as rules, and had only a works/doesn't work return value? Just wondering By Hank Thediek at 2005-06-07 13:19 | LtU Forum | previous forum topic | next forum topic | other blogs | 12045 reads
|
Browse archives
Active forum topics |
Recent comments
14 weeks 15 hours ago
14 weeks 19 hours ago
14 weeks 19 hours ago
36 weeks 2 days ago
40 weeks 3 days ago
42 weeks 1 day ago
42 weeks 1 day ago
44 weeks 5 days ago
49 weeks 3 days ago
49 weeks 3 days ago