User loginNavigation |
archives2005 Programming Languages Day at WatsonThe Sixth IBM Programming Languages Day will be held at the IBM Thomas J. Watson Research Center on Friday, April 22, 2005. The day will be held in cooperation with the New Jersey and New England Programming Languages and Systems Seminars. The main goal of the event is to increase awareness of each other's work, and to encourage interaction and collaboration. Simon Peyton Jones is keynoting on composable memory transactions. The program, and abstracts, are available online. Computer generates verifiable mathematics proof
NewScientist.com:
A computer-assisted proof of a 150-year-old mathematical conjecture can at last be checked by human mathematicians... ...Georges Gonthier, at Microsoft's research laboratory in Cambridge, UK, and Benjamin Werner at INRIA in France have proven the [Four Colour Theorem] in a way that should remove such concerns. Georges Gonthier's home page includes links to the paper and the actual proof. Constructing Sequent Rules for Generalized Propositional Logics
Constructing Sequent Rules for Generalized Propositional Logics
A very short paper having pretty narrow applicability, but somehow it is exactly what I needed today for my programming. Go figure. The concept of a propositional logic, PL, will be defined and a method, to be referred to as the Kleene Search Procedure, will be used to determine the validity of formulas of PL. This method utilizes a set of sequent rules which are derived in a purely mechanical fashion from the truth tables which are the intended interpretations of the connectives of PL. The results are then used to show how a formal system, GPL, which is a sequent calculus can be constructed with very simple axioms and these sequent rules to yield the valid formulas of PL Note that there are two "mechanical" algorithms here - one deriving sequent rules from truth tables, and another deriving either a proof ar a refutation of a sequent. I wonder just how deeply this is related to both Qi and the map coloring theorem proof (didn't read any of those threads carefully yet). By Andris Birkmanis at 2005-04-21 18:05 | LtU Forum | login or register to post comments | other blogs | 5555 reads
Why do they program in C++?Over at comp.lang.c++.moderated, there is a thread created by the c++ guru Scott Meyers on the subject: "Why do you program in c++?".
I thought this might be interesting. |
Browse archivesActive forum topics |
Recent comments
22 weeks 10 hours ago
22 weeks 14 hours ago
22 weeks 14 hours ago
44 weeks 1 day ago
48 weeks 3 days ago
50 weeks 22 hours ago
50 weeks 22 hours ago
1 year 4 days ago
1 year 5 weeks ago
1 year 5 weeks ago