Lambda the Ultimate

Deerfield Beach, Florida, January 3-6, 2009
http://lfcs.info/lfcs09/

The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science. The LFCS series began with Logic at Botik, Pereslavl-Zalessky, 1989 and was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver), after which organization passed to Anil Nerode.

LFCS Topics. Topics of interest include, but are not limited to:
* constructive mathematics and type theory;
* logic, automata and automatic structures;
* computability and randomness;
* logical foundations of programming;
* logical aspects of computational complexity;
* logic programming and constraints;
* automated deduction and interactive theorem proving;
* logical methods in protocol and program verification;
* logical methods in program specification and extraction;
* domain theory logics;
* logical foundations of database theory;
* equational logic and term rewriting;
* lambda and combinatory calculi;
* categorical logic and topological semantics;
* linear logic;
* epistemic and temporal logics;
* intelligent and multiple agent system logics;
* logics of proof and justification;
* nonmonotonic reasoning;
* logic in game theory and social software;
* logic of hybrid systems;
* distributed system logics;
* mathematical fuzzy logic;
* system design logics;
* other logics in computer science.

Proceedings will be published in the LNCS series. There will be a post-conference volume of selected works published in the Annals of Pure and Applied Logic.

Important Dates:
* Submission server available: September 1, 2008
* Submissions deadline (firm): September 14, 2008
* Notification: October 5, 2008
* Final papers for proceedings: October 15, 2008
* Symposium dates: January 3 - 6, 2009