November 2012 - Categories - categories.org.au

Partial functor
by David Leduc 16 Mar '15

16 Mar '15

Hi, A partial functor from C to D is given by a subcategory S of C and a functor from S to D. What is the appropriate notion of natural transformation between partial functors that would allow to turn small categories, partial functors and those "natural transformations" into a bicategory? The difficulty is that two partial functors from C to D might not have the same definition domain. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

7 6

Research positions
by Maria Manuel Clementino 26 Feb '14

26 Feb '14

5-YEAR RESEARCH POSITIONS The Centre for Mathematics of the University of Coimbra (CMUC) invites applications for five 5-year research positions in all areas of Mathematics. Applicants should have a PhD in Mathematics and at least three years of post-doctoral experience, with an international-level publication record and demonstrated ability to perform independent research. Preference will be given to candidates working in one of the areas in which the members of CMUC are currently active. A very good command of English is required. The appointments will be made for three years, renewable for two more. Successful applicants are expected to develop research within the areas of interest of CMUC. They should also contribute to graduate studies, supervising students from the Department of Mathematics. The basic salary is equivalent to the index 195 of the Portuguese research career (in the order of 42 500 euros a year), in accordance with the Ciência 2008 guidelines http://alfa.fct.mctes.pt/apoios/contratacaodoutorados/edital2008 Benefits include private health insurance and social security. Applicants should send • cover sheet (available from www.mat.uc.pt/cmuc/coversheet.pdf) including names and contact information of three persons who can provide a letter of recommendation • curriculum vitae (publication list included) • a 5-year research proposal (2 pages max), emphasizing their own research goals as pdf files to cmuc(a)mat.uc.pt. The subject of the e-mail message must include the job reference C2008 FCTUC CMUC v15-v19. The deadline for applications is *September 10, 2008.* ------------------------------ More information can be found at www.mat.uc.pt

1 1

separable locale
by Thomas Streicher 17 May '13

17 May '13

Recently rereading Fourman's "Continuous Truth" I came across the term "separable locale" but could nowhere find an explanation. Does it mean a cHa A for which there exists a countable subset B such that ever a in A is the supremum of those b in B with b leq a. This would be the point free account of "second countable", i.e. having a countable basis. Of course, second countable T_) spaces are separable, i.e. have a countable dense set. Is this reading the "usual" one? Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

5 4

CiE 2013: The Nature of Computation, Milan, Italy, July 1-5, 2013
by S B Cooper 29 Nov '12

29 Nov '12

************************************************************************ CALL FOR PAPERS: CiE 2013: The Nature of Computation Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. CiE 2013 conference topics include, but not exclusively: * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

TLCA 2013 Second Call for Papers
by Luca Paolini 29 Nov '12

29 Nov '12

================================================================ TLCA 2013 Second Call for Papers 11th International Conference on Typed Lambda Calculi and Applications Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 TLCA 2013 webpage: http://www.kurims.kyoto-u.ac.jp/tlca2013/ RDP 2013 webpage: http://www.win.tue.nl/rdp2013/ [NEW: Invited Speakers Confirmed] ================================================================ The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: * Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models * Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants * Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization INVITED SPEAKERS * Simon Peyton-Jones (Microsoft Cambridge, UK) Joint invited speaker for RTA+TLCA 2013 * Hugo Herbelin (INRIA, France) invited speaker for TLCA 2013 * Damiano Mazza (Universite Paris-Nord, France) invited speaker for TLCA 2013 IMPORTANT DATES * Paper Registration (titles & short abstracts): 25 January 2013 * Full Paper Submission: 1 February 2013 * Author Notification: 22 March 2013 * Camera-Ready Paper for the Proceedings: 12 April 2013 SUBMISSION GUIDELINES We solicit submissions of research papers, which must: * be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers will be told that they may choose to ignore the appendix. * present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) * use the Springer-Verlag LNCS style. * be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage https://www.easychair.org/conferences/?conf=tlca2013 . Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa <tlca2013(a)easychair.org>) prior to submitting. COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) TLCA STEERING COMMITTEE Samson Abramsky (University of Oxford, UK) Henk Barendregt (Radboud University Nijmegen, Netherlands) Pierre-Louis Curien (CNRS and Universite Paris Diderot, France) Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy) Martin Hofmann (LMU Munchen, Germany) Luke Ong (University of Oxford, UK) Simona Ronchi Della Rocca (Universita di Torino, Italy) Pawel Urzyczyn (University of Warsaw, Poland) TLCA HONORARY ADVISOR Roger Hindley (Swansea University) TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PhD opportunities in the Computer Science theory group at Birmingham
by Paul Levy 27 Nov '12

27 Nov '12

Dear all, We invite applications for PhD study at the University of Birmingham. We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation and programming language semantics. This often involves profound and surprising connections between different areas of computer science and mathematics. From category theory to λ-calculus and computational effects, from topology to constructive mathematics, from game semantics to program compilation, this is a diverse field of research that continues to provide new insight and underlying structure. See our webpage, with links to individual researchers, here: http://www.cs.bham.ac.uk/research/groupings/theory/ Information about PhD applications may be found here: http://www.cs.bham.ac.uk/admissions/postgraduate-research/ If you are considering applying, please contact any of us. We will be very happy to discuss the opportunities available. Best regards, the Birmingham CS theory group Martín Escardó (Topology, computation with infinite objects, constructive mathematics, intuitionistic type theory) Dan Ghica (Game semantics, heterogeneous computing, model checking) Achim Jung (Mathematical structures in the foundations of computing: logic, topology, order) Paul Levy (Denotational semantics, λ-calculus with effects, nondeterminism, category theory, game semantics) Uday Reddy (Semantics of state, separation logic) Eike Ritter (Security protocol verification) Hayo Thielecke (Abstract machines, concurrent and functional programming, software security) Steve Vickers Constructive mathematics and topology, category theory and toposes -- Paul Blain Levy School of Computer Science, University of Birmingham +44 121 414 4792 http://www.cs.bham.ac.uk/~pbl [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Spinoza Award
by Ross Street 27 Nov '12

27 Nov '12

Congratulations to Ieke Moerdijk who has won the Spinoza Prize! It is the highest award in science of The Netherlands. See: http://www.nwo.nl/nwohome.nsf/pages/NWOP_5VNCW6_Eng Ross [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1

10th Annual Conference on Theory and Applications of Models of Computation (TAMC13)
by S B Cooper 26 Nov '12

26 Nov '12

FIRST CALL FOR PAPERS: TAMC 2013 The 10th annual conference on Theory and Applications of Models of Computation University of Hong Kong, Pokfulam, Hong Kong Important Dates Submission deadline : 11:59 pm EST January 11, 2013 Notification of authors : late February or early March, 2013 Final versions deadline : to be announced soon The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer (http://www.springer.com/lncs) Authors of accepted papers are expected to present their work at the conference. Post Conference Publications Special issues of the journals Theoretical Computer Science and Mathematical Structures in Computer Science devoted to a selected set of accepted papers of the conference are planned. Aims and Scope TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference are computability, complexity, and algorithms. Typical but not exclusive topics of interest include: * algebraic computation * algorithmic coding theory * algorithmic number theory * approximation algorithms * automata theory * circuit complexity * computability * computational biology, and biological computing * computational complexity * computational game theory * computational logic * computational geometry * continuous and real computation * cryptography * data structures * design and analysis of algorithms * distributed algorithms * fixed parameter tractability * graph algorithms * information and communication complexity * learning theory * natural computation * network algorithms, networks in nature and society * online algorithms * optimization * parallel algorithms * privacy and security * property testing * proof complexity * quantum computing * randomness, pseudo-randomness * randomized algorithms * streaming algorithms http://www.cs.hku.hk/tamc2013/call.htm [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Distributive lattices and coherence in homological algebra
by Marco Grandis 21 Nov '12

21 Nov '12

The following paper has been published: M. Grandis, Distributive lattices and coherence in homological algebra, Asia Pac. Math. Newsl., 2 no. 4 (2012), 11-16. http://www.asiapacific-mathnews.com/ (free online) Abstract. This article is about coherence in homological algebra, and only needs the elementary theory of abelian groups and lattices. Its results are developed in a recent book to analyse spectral sequences – an important tool of homological algebra with applications in many branches of mathematics. ---- The article deals with part of a conference at CatAlg2011, Gargnano (Italy), in September 2011. It is a reduced version of a preprint, 'Coherence and distributive lattices in homological algebra', that was announced in this list in January 2012. The book referred to is: 'Homological Algebra, The interplay of homology with distributive lattices and orthodox semigroups, World Scientific Publishing Co., 2012. Best regards to colleagues and friends Marco Grandis [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Body of mathematical concepts
by Venkata Rayudu Posina 16 Nov '12

16 Nov '12

Dear All, Mathematical concepts such as 1, singleton set, and objects satisfying universal mapping properties are placed in well-defined positions. One ready illustration: the way 1 is related to a singleton set (property-value of a structure) is determinately definite and different from the ways in which singletons are related to objects satisfying universal mapping properties (example, sorting). We can also, for example, read vividly going from 1 to singleton set to terminal object to objects satisfying universal mapping properties to map object to its size--a number--all in the space of a line segment: a figure is the locus of a varying element (Conceptual Mathematics, page 83). Mathematical concepts, from this perspective, appear to be clearly organized. Would you be kind enough to point me to our current understanding (say, a textbook) of the structure of the body of mathematical concepts. Happy Philosophy Day! Thank you, posina [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0