headers
Arnold Beckmann | 3 May 2008 22:42
Picon
Picon
Favicon

Computability in Europe 2008 - early registration reminder

[Apologies for multiple copies]

****************************************************************

    Computability in Europe 2008: Logic and Theory of Algorithms
                  University of Athens, June 15-20 2008
                     http://www.cs.swan.ac.uk/cie08/

          REMINDER:  EARLY REGISTRATION ENDS 11 May 2008

We would like to remind participants that registration is only complete
once we have received the payment form.  In order to give participants
who have not yet send their payment form time to react to this reminder
we decided to extend the early registration deadline to 11 May 2008.

Registration for CiE 2008:
    http://www.cs.swan.ac.uk/cie08/registration.php

You can also use the registration process to book accommodation:
    http://www.cs.swan.ac.uk/cie08/accommodation.php

SOME DETAILS OF THE PROGRAMME
=============================

TUTORIALS will be given by:
John V. Tucker (Swansea)
Moshe Y. Vardi (Houston, TX)

PLENARY SPEAKERS will include:
Keith Devlin (Stanford, CA)
(Continue reading)

Permalink | Reply | 0 comments |
headers
ICLP 08 | 5 May 2008 16:27

ICLP'08 CALL FOR PAPERS

                               CALL FOR PAPERS
                                    ICLP'08

              24th International Conference on Logic Programming
                     Udine, Italy, December 9th-13th, 2008
                          http://iclp08.dimi.uniud.it

CONFERENCE SCOPE
----------------
Since  the  first  conference  held  in  Marseilles  in 1982, ICLP has been the
premier  international conference for presenting research in logic programming.
Contributions (papers, position papers, and posters) are sought in all areas of
logic programming including but not restricted to:

* Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning,
   Knowledge Representation.
* Implementation: Compilation, Memory Management, Virtual Machines, Parallelism.
*  Environments:  Program  Analysis,  Program  Transformation,  Validation  and
   Verification, Debugging, Profiling, Integration.
* Language  Issues:  Extensions, Integration with Other Paradigms, Concurrency,
   Modularity,  Objects,  Coordination,  Mobility,  Higher Order, Types, Modes,
   Programming Techniques.
* Related Paradigms:  Abductive Logic Programming, Inductive Logic Programming,
   Constraint Logic Programming, Answer-Set Programming.
* Applications:   Databases,    Data   Integration  and   Federation,  Software
   Engineering,  Natural  Language  Processing,  Web  and Semantic Web, Agents,
   Artificial Intelligence, Bioinformatics

The three broad categories for submissions are:
   (1) Technical papers,  providing  novel research  contributions,  innovative
(Continue reading)

Permalink | Reply | 0 comments |
headers
Joachim Kock | 6 May 2008 19:44

Workshop on Categorical Groups, second announcement

This is the second announcement of the

         WORKSHOP ON CATEGORICAL GROUPS
              June 16 to 20, 2008
Institut de Matemàtica de la Universitat de Barcelona

an event within the CRM thematic year on Homotopy Theory 
and Higher Categories (http://www.crm.cat/hocat/).

The workshop will focus on recent developments in the theory 
of categorical groups and related topics, as well as their 
applications to higher-order geometry and theoretical physics.

The following have agreed to give keynote talks:

- John Baez (University of California at Riverside)
- André Joyal (Université du Québec à Montréal)
- Behrang Noohi (Florida State University)
- Tim Porter (National University of Ireland and Bangor University)
- Enrico Vitale (Université Catholique de Louvain)

Further information will gradually be made available at
http://mat.uab.cat/~kock/crm/hocat/cat-groups/.
The deadline for registration is May 31, 2008.

The organisers,
   Pilar Carrasco
   Josep Elgueta
   Joachim Kock
   Antonio Rodríguez Garzón
(Continue reading)

Permalink | Reply | 0 comments |
headers
Sanjeevi Krishnan | 7 May 2008 13:42
Picon

Second Call for Papers: ATMCS III, Paris France July 7-11, 2008

My apologies for duplicate copies of this annoucement.

ATMCS III
Algebraic Topological Methods in Computer Science
Paris, France 7-11 July 2008
http://www.lix.polytechnique.fr/~sanjeevi/atmcs/
(poster available for download here)

***SECOND CALL FOR PAPERS***
(New) deadline for abstract submissions: 22 May 2008
Notification of acceptance: 5 June 2008
Deadline for registration: 15 June 2008
Conference: 7-11 July 2008
contact information: atmcs08 <at> lix.polytechnique.fr

Recent research has shown that techniques from algebraic topology
adapt strikingly well in studying computational systems and other
subjects within Computer Science. This third ATMCS conference hopes
to bring together researchers employing geometric/topological methods
in both abstract and concrete areas of computer science. The week-long
conference will feature some invited talks, several accepted talks, a
poster session, and countless opportunities for informal
collaboration; we plan to publish our proceedings in a refereed
journal, pending approval. All authors submitting an abstract by the
deadline will have an opportunity, at the least, to present a
(refereed) poster at the poster session.

***SCOPE***
Areas of interest include, but are not limited to, concurrency theory,
distributed computing and complexity, rewriting systems, image
(Continue reading)

Permalink | Reply | 0 comments |
headers
David Roberts | 7 May 2008 08:59
Picon
Picon
Favicon

Strictifying monoidal functors

Hi all,

While we can make all monoidal categories strict, I was wondering how
strict we can make monoidal functors. More precisely, given a strong
monoidal functor F:(C, <at> ,I) --> (D,*,1) between strict monoidal
categories, it has the data

m_xy: F(x)*F(y) ---> F(x <at> y)   (natural)

u:1 ---> F(I).

Is F naturally isomorphic to a strong monoidal functor such that u is
the identity?

In Baez-Lauda HDA 5 it is an exercise to the reader in the proof of
Proposition 8.3.6 to do this for weak monoidal categories.

Cheers,

David
Permalink | Reply | 0 comments |
headers
Andrei Sabelfeld | 9 May 2008 13:48
Picon
Picon

IEEE CSF 2008 call for participation


			Call For Participation

       21st IEEE Computer Security Foundations Symposium (CSF)
		Pittsburgh, PA, USA, June 23-25, 2008

The registration is now open. Early registration ends on June 1.
Online late registration is open June 2-10.

The specialty of this year is co-location with IEEE LICS 2008. There
are a few joint CSF/LICS activities to look forward to, including a
joint invited talk by David Basin, joint regular- and short-talk
sessions and 8 workshops related to security foundations and
logic. Further information (including a detailed program) is on the
CSF 2008 web site:

		  http://www.cylab.cmu.edu/CSF2008/

Hope to see you in Pittsburgh!

Anupam Datta (General Chair) and Andrei Sabelfeld (Program Chair)
Permalink | Reply | 0 comments |
headers
ICLP 08 | 9 May 2008 16:16

ICLP'08 CALL FOR APPLICATION PAPERS

                                   ICLP'08
                     Solicitation for Application Papers

              24th International Conference on Logic Programming
                    Udine, Italy, December 9th-13th, 2008
                         http://iclp08.dimi.uniud.it

Within  the  scope  of  the  general  call  for  papers  for  the upcoming 24th
International  Conference  on  Logic  Programming,  we  would  like to draw the
attention  of  researchers  and  practitioners  on  the  opportunity  to submit
manuscripts to the Application Track of the conference.

Application  papers,  are  expected  to  describing  complex  and/or real-world
applications  that  rely in an essential manner on the use of logic programming
technology.  Description  of  innovative  applications  as  well as engineering
solutions leveraging logic programming technology are solicited.

SUBMISSION:
-----------
Papers  must describe original, previously unpublished results, and must not be
simultaneously submitted for publication elsewhere.

Submissions  MUST  contain  substantial  original,  unpublished  material.  All
submissions must be written in English. Application papers should be structured
to emphasize:

       * the application domain, in terms understandable by a layman
       * the specific problem addressed within the application domain,
         stressing importance and complexity
       * a clear discussion of the unique need for logic programming technology
(Continue reading)

Permalink | Reply | 0 comments |
headers
Tom Hirschowitz | 9 May 2008 10:32
Picon
Favicon
Gravatar

Postdoc position at University of Savoy


Dear categorists,

There is a one year postdoc position opening at University of Savoy,

http://www.univ-savoie.fr/Portail

starting next october. My team (computer science, logic, and discrete
maths)

http://www.lama.univ-savoie.fr/index.php?use=membres&equipe=logique&lang=en

in the math lab

http://www.lama.univ-savoie.fr/index.php

would welcome and put forward any good candidate in category theory,
or using categories to do logic or computer science.

The deadline is June, 18th, and the administrative burden is minimal
(cv plus short description of the scientific project), so don't
hesitate to apply.

Please contact me for any further question,

  Tom
Permalink | Reply | 0 comments |
headers
Zhaohua Luo | 10 May 2008 19:01

FW: Hyperalgebras


Hyperalgebras

<http://www.algebraic.net/cag/hyperalgebra.html>
<http://www.algebraic.net/cag/hyperalgebra.html>
<http://www.algebraic.net/cag/hyperalgebra.html>
http://www.algebraic.net/cag/hyperalgebra.html

Zhaohua Luo (5/2008)

Part I

Abstract: A hyperalgebra is an algebra of type (0, 0, ..., 2, 3, 4, ...)
satisfying three axioms.

Finitary hyperalgebras form a coreflective full subcategory of the variety
of hyperalgebras, which

is equivalent to the opposite of the category of varieties.

Thus any subvariety of the variety of hyperalgebras may be viewed as a
hypervariety,

i.e. a variety of varieties in the sense of W. D. Neumann.

Definition. A hyperalgebra is a nonempty set A together with a sequence

X = {x_1, x_2, ...} of elements of A and a sequence S = {s_1, s_2, ...}

of operations s_n: A^{n+1} -> A, which satisfies the following axioms for M,
(Continue reading)

Permalink | Reply | 0 comments |
headers
Michael Barr | 12 May 2008 14:34
Picon
Favicon

Further to my question on adjoints

In March I asked a question on adjoints, to which I have received no
correct response.  Rather than ask it again, I will pose what seems to be
a simpler and maybe more manageable question.  Suppose C is a complete
category and E is an object.  Form the full subcategory of C whose objects
are equalizers of two arrows between powers of E.  Is that category closed
in C under equalizers?  (Not, to be clear, the somewhat different question
whether it is internally complete.)

In that form, it seems almost impossible to believe that it is, but it is
surprisingly hard to find an example.  When E is injective, the result is
relatively easy, but when I look at examples, it has turned out to be true
for other reasons.  Probably there is someone out there who already knows
an example.

Michael
Permalink | Reply | 0 comments |

Gmane