[TYPES/announce] IMLA11: Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Fifth International Workshop on Intuitionistic Modal Logic and Applications (IMLA'11) (http://www.agents.cs.nott.ac.uk/events/imla11) A 14th Logic, Methodology and Philosophy of Science affiliated workshop Nancy, France, July, 2011 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications are in type disciplines for programming languages, and meta-logics for reasoning about a variety of computational phenomena. Theoretical and methodological issues center around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. This workshop will bring together designers, implementers, and users to discuss all aspects of intuitionistic modal logics and type theories. Topics include, but are not limited to: * applications of intuitionistic necessity and possibility * monads and strong monads * constructive belief logics and type theories * applications of constructive modal logic and modal type theory to formal verification, foundations of security, abstract interpretation, and program analysis and optimization * modal types for integration of inductive and co-inductive types, higher-order abstract syntax, strong functional programming * models of constructive modal logics such as algebraic, categorical, Kripke, topological, and realizability interpretations * notions of proof for constructive modal logics * extraction of constraints or programs from modal proofs * proof search methods for constructive modal logics and their implementations The workshop continues a series of previous LICS-affiliated workshops, which were held as part of FLoC'99, Trento, Italy and of FLoC'02, Copenhagen, Denmark,part of LiCS2005, Chicago, USA and LiCS2008, Pittsburgh, USA. We solicit submissions on work in progress and on more mature results. Submissions should be extended abstracts of 5-10 pages sent in PDF format to either or both of the co-chairs n...@cs.nott.ac.uk, valeria.depa...@gmail.com. IMPORTANT DATES: Submission: December 15, 2010 Notification: January 15, 2011 Final papers due: March 31, 2011 Workshop Date: TBA It is planned to publish workshop proceedings as Electronic Notes in Theoretical Computer Science (ENTCS) or in CEURS, to be decided. Authors please use the generic ENTCS macro package at http://www.math.tulane.edu/~entcs. INVITED SPEAKERS include: Michael Mendler (Bamberg, DE) Brian Logan (Nottingham, UK) Lutz Strassburger (LIX, FR) PROGRAM COMMITTEE Nick Benton (Microsoft, UK) Natasha Alechina (Nottingham, UK) Didier Galmiche (Nancy, FR) Hermann Hausler (PUC-RJ, BR) Valeria de Paiva (Birmingham, UK) CONTACTS Natasha Alechina (n...@cs.nott.ac.uk) Valeria de Paiva (valeria.depa...@gmail.com) -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/www/ -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/www/
[TYPES/announce] Workshop on Natural Language and Computer Science (NLCS '13)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Workshop on Natural Language and Computer Science (NLCS '13) http://www.indiana.edu/~iulg/nlcs.html A workshop to be held at LiCS'13: June 28, 2013 New Orleans, Louisiana Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics. AIMS AND SCOPE Formal tools coming from logic and category theory are important in both natural language semantics and in computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language has inspired developments on the formal side. The workshop invites papers on both topics. Specific topics include, but are not limited to: * logic for semantics of lexical items, sentences, discourse and dialog * continuations in natural language semantics * formal tools in textual inference, such as logics for natural language inference * applications of category theory in semantics * linear logic in semantics * formal approaches to unifying data-driven and declarative approaches to semantics IMPORTANT DATES Paper submission: May 1, 2013 Notification: May 15, 2013 Workshop Date: 28 June 2013 Possible Extension to: 29 June 2013 LICS'13 Dates: 25-28 June 2013 INVITED SPEAKERS Ian Pratt-Hartmann, University of Manchester, UK. Wlodek Zadrozny, UNC, Charlotte, North Carolina. LENGTH OF THE WORKSHOP We plan for a one-day workshop, but with sufficient interest we have the option to extend the workshop to a second day. SUBMISSIONS Please submit extended abstracts of up to 15 pages using EasyChair: https://www.easychair.org/conferences/?conf=nlcs13 ORGANIZERS Valeria de Paiva, Nuance Communications Larry Moss, Indiana University PROGRAM COMMITTEE Valeria de Paiva, Nuance Bill MacCartney, Google and Stanford University Larry Moss, Indiana University Annie Zaenen, Stanford University -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/
[TYPES/announce] 5th Workshop on Natural Language and Computer Science NLCS '18 July 7-8, 2018
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Fifth Workshop on Natural Language and Computer Science NLCS '18 July 7-8, 2018 Oxford, UK http://www.indiana.edu/~iulg/nlcs.html A workshop affiliated with Federated Logic Conference (FLoC) 2018 Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics. We are grateful to Jesus College, Oxford, for their support of our workshop. AIMS AND SCOPE Formal tools coming from logic and category theory are important in both natural language semantics and in computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language has inspired developments on the formal side. The workshop invites papers on both topics. Specific topics includes, but are not limited to: * logic for semantics of lexical items, sentences, discourse and dialog * continuations in natural language semantics * formal tools in textual inference, such as logics for natural language inference * applications of category theory in semantics * linear logic in semantics * formal approaches to unifying data-driven and declarative approaches to semantics INVITED SPEAKERS Ann Copestake, University of Cambridge Aurelie Herbelot, Universitat Pompeu Fabra, Barcelona PROGRAM COMMITTEE Ash Asudeh, University of Oxford/Carleton University Simon Charlow, Rutgers University Valeria de Paiva, Nuance.com Thomas Graf, State University of New York, Stony Brook Martha Lewis, University of Oxford Larry Moss, Indiana University, Bloomington Christian Retoré, Université de Montpellier Mehrnoosh Sadrzadeh, Queen Mary University of London Annie Zaenen, Stanford University PAPER SUBMISSIONS Extended abstracts of up to 10 pages may be submitted through Easychair: https://easychair.org/conferences/?conf=nlcs18 ORGANIZERS Ash Asdeh University of Oxford/Carleton University Email: ash.asudeh at ling-phil. ox. ac.uk Valeria de Paiva Nuance.com Email: Valeria.dePaiva at nuance .com Larry Moss Indiana University Email: lsm at cs.indiana . edu IMPORTANT DATES Paper submission: May 1, 2018 Notification: May 15, 2018 Electronic versions due: May 31, 2018 -- Valeria de Paiva http://vcvpaiva.github.io/ http://research.nuance.com/author/valeria-de-paiva/ http://www.cs.bham.ac.uk/~vdp/
[TYPES/announce] CfP Joint Linearity & TLLA Workshop
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] We're monitoring the Coronavirus situation and will keep you posted. FIRST Call for Papers Sixth International Workshop on Linearity Fourth International Workshop on Trends in Linear Logic and Applications Paris, Aubervilliers, France, 29-30 June 2020 Affiliated with FSCD 2020 https://lipn.univ-paris13.fr/LinearityTLLA2020/ Linearity has been a key feature in several lines of research in both theoretical and practical approaches to computer science. On the theoretical side there is much work stemming from linear logic dealing with proof technology, complexity classes, and more recently quantum computation. On the practical side, there is work on program analysis, expressive operational semantics for programming languages, linear programming languages, program transformation, update analysis and efficient implementation techniques. Linear logic is not only a theoretical tool to analyse the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that were originally developed for the study of linear logic's syntax and semantics and are nowadays applied in several other fields. The aim of this Joint Linearity and TLLA workshop is to bring together researchers who are currently working on linear logic and related fields, to foster their interaction and provide a forum for presenting new ideas and work in progress. We also hope to enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include: - theory of programming languages - type systems - verification - models of computation - implicit computational complexity - parallelism and concurrency - games and languages - proof theory - philosophy - categories and algebra - connections with combinatorics - linguistics - functional analysis and operator algebras IMPORTANT DATES * Submission deadline: 24th April 2020 * Author notification: 15th May 2020 * Contribution for Informal Proceedings: 29th May 2020 * Workshop date: 29-30 June 2020 SUBMISSIONS Authors are invited to submit: * an extended abstract (8 pages max) describing original ideas and results not published nor submitted elsewhere, * or a 5-page abstract presenting relevant work that has been or will be published elsewhere, * or a 2-page description of work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://easychair.org/conferences/?conf=tllalinearity2020 POST-PROCEEDINGS After the workshop, authors of extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in EPTCS (TBC). These submissions will undergo a second round of refereeing. PROGRAMME COMMITTEE Raphaelle Crubillé http://research.crubille.lautre.net/ Ugo Dal Lago (co-chair) https://www.unibo.it/sitoweb/ugo.dallago/en Valeria De Paiva (co-chair) http://vcvpaiva.github.io/ Harley Eades http://metatheorem.org/ Koko Muroya http://www.kurims.kyoto-u.ac.jp/~kmuroya/ Michele Pagani https://www.irif.fr/~michele/ Elaine Pimentel https://sites.google.com/site/elainepimentel/ Giselle Reis https://www.qatar.cmu.edu/directory/giselle-reis/ Thomas Seiller https://www.seiller.org/ Daniel Ventura http://www.inf.ufg.br/~daniel/ Lionel Vaux https://www.i2m.univ-amu.fr/perso/lionel.vaux/ -- Valeria de Paiva http://vcvpaiva.github.io/ http://www.cs.bham.ac.uk/~vdp/
[TYPES/announce] Second Call for Papers: VIRTUAL Linearity & TLLA 2020
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] === SECOND Call for Papers Joint Linearity & TLLA Workshop Sixth International Workshop on Linearity Fourth International Workshop on Trends in Linear Logic and Applications Paris, Aubervilliers, France, 29-30 June 2020 Affiliated with FSCD 2020 https://lipn.univ-paris13.fr/LinearityTLLA2020/ *COVID-19 Emergency*: *Our highest priority is the safety of all participants. Due to the covid19 pandemic, Linearity and TLLA 2020 will happen as a virtual conference. More details will follow when we know from the main organizers of FSCD 2020, athttps://fscd2020.org/2020/04/01/Virtualisation-FSCD-IJCAR-2020/ <https://fscd2020.org/2020/04/01/Virtualisation-FSCD-IJCAR-2020/>.* Linearity has been a key feature in several lines of research in both theoretical and practical approaches to computer science. On the theoretical side there is much work stemming from linear logic dealing with proof technology, complexity classes, and more recently quantum computation. On the practical side, there is work on program analysis, expressive operational semantics for programming languages, linear programming languages, program transformation, update analysis and efficient implementation techniques. Linear logic is not only a theoretical tool to analyse the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that were originally developed for the study of linear logic's syntax and semantics and are nowadays applied in several other fields. The aim of this Joint Linearity and TLLA workshop is to bring together researchers who are currently working on linear logic and related fields, to foster their interaction and provide a forum for presenting new ideas and work in progress. We also hope to enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include: - theory of programming languages - type systems - verification - models of computation - implicit computational complexity - parallelism and concurrency - games and languages - proof theory - philosophy - categories and algebra - connections with combinatorics - linguistics - functional analysis and operator algebras IMPORTANT DATES * EXTENDED Submission deadline: 24th April 2020 * Author notification: 15th May 2020 * Contribution for Informal Proceedings: 29th May 2020 * Workshop date: 29-30 June 2020 SUBMISSIONS Authors are invited to submit: * an extended abstract (8 pages max) describing original ideas and results not published nor submitted elsewhere, * or a 5-page abstract presenting relevant work that has been or will be published elsewhere, * or a 2-page description of work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://easychair.org/conferences/?conf=tllalinearity2020 POST-PROCEEDINGS After the workshop, authors of extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in EPTCS (TBC). These submissions will undergo a second round of refereeing. PROGRAMME COMMITTEE Raphaelle Crubillé http://research.crubille.lautre.net/ Ugo Dal Lago (co-chair) https://www.unibo.it/sitoweb/ugo.dallago/en Valeria De Paiva (co-chair) http://vcvpaiva.github.io/ Harley Eades http://metatheorem.org/ Koko Muroya http://www.kurims.kyoto-u.ac.jp/~kmuroya/ Michele Pagani https://www.irif.fr/~michele/ Elaine Pimentel https://sites.google.com/site/elainepimentel/ Giselle Reis https://www.qatar.cmu.edu/directory/giselle-reis/ Thomas Seiller https://www.seiller.org/ Daniel Ventura http://www.inf.ufg.br/~daniel/ Lionel Vaux https://www.i2m.univ-amu.fr/perso/lionel.vaux/ -- Valeria de Paiva http://vcvpaiva.github.io/ http://www.cs.bham.ac.uk/~vdp/ -- Valeria de Paiva http://vcvpaiva.github.io/ http://www.cs.bham.ac.uk/~vdp/
[TYPES/announce] FINAL Call for Papers: VIRTUAL Linearity & TLLA 2020
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] === FINAL Call for Papers: NEW DEADLINE 4th May 2020 Joint Linearity & TLLA Workshop Sixth International Workshop on Linearity Fourth International Workshop on Trends in Linear Logic and Applications Paris, Aubervilliers, France, 29-30 June 2020 Affiliated with FSCD 2020 https://lipn.univ-paris13.fr/LinearityTLLA2020/ *COVID-19 Emergency*: *Our highest priority is the safety of all participants. Due to the covid19 pandemic, Linearity and TLLA 2020 will happen as a virtual conference. More details will follow when we know from the main organizers of FSCD 2020, athttps://fscd2020.org/2020/04/01/Virtualisation-FSCD-IJCAR-2020/ <https://fscd2020.org/2020/04/01/Virtualisation-FSCD-IJCAR-2020/>.* Linearity has been a key feature in several lines of research in both theoretical and practical approaches to computer science. On the theoretical side there is much work stemming from linear logic dealing with proof technology, complexity classes, and more recently quantum computation. On the practical side, there is work on program analysis, expressive operational semantics for programming languages, linear programming languages, program transformation, update analysis and efficient implementation techniques. Linear logic is not only a theoretical tool to analyse the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that were originally developed for the study of linear logic's syntax and semantics and are nowadays applied in several other fields. The aim of this Joint Linearity and TLLA workshop is to bring together researchers who are currently working on linear logic and related fields, to foster their interaction and provide a forum for presenting new ideas and work in progress. We also hope to enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include: - theory of programming languages - type systems - verification - models of computation - implicit computational complexity - parallelism and concurrency - games and languages - proof theory - philosophy - categories and algebra - connections with combinatorics - linguistics - functional analysis and operator algebras IMPORTANT DATES * EXTENDED Submission deadline: 4th May 2020 * Author notification: 29th May 2020 * Contribution for Informal Proceedings: 12th June 2020 * Workshop date: 29-30 June 2020 SUBMISSIONS Authors are invited to submit: * an extended abstract (8 pages max) describing original ideas and results not published nor submitted elsewhere, * or a 5-page abstract presenting relevant work that has been or will be published elsewhere, * or a 2-page description of work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://easychair.org/conferences/?conf=tllalinearity2020 POST-PROCEEDINGS After the workshop, authors of extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in EPTCS (TBC). These submissions will undergo a second round of refereeing. PROGRAMME COMMITTEE Raphaelle Crubillé http://research.crubille.lautre.net/ Ugo Dal Lago (co-chair) https://www.unibo.it/sitoweb/ugo.dallago/en Valeria De Paiva (co-chair) http://vcvpaiva.github.io/ Harley Eades http://metatheorem.org/ Koko Muroya http://www.kurims.kyoto-u.ac.jp/~kmuroya/ Michele Pagani https://www.irif.fr/~michele/ Elaine Pimentel https://sites.google.com/site/elainepimentel/ Giselle Reis https://www.qatar.cmu.edu/directory/giselle-reis/ Thomas Seiller https://www.seiller.org/ Daniel Ventura http://www.inf.ufg.br/~daniel/ Lionel Vaux https://www.i2m.univ-amu.fr/perso/lionel.vaux/
[TYPES/announce] Last Call (deadline Jan 31): School of Formalized Mathematics at the Hausdorff Trimester "Prospects of Formalized Mathematics" (May 13 - 17, 2024)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] The Hausdorff Trimester "Prospects of Formalized Mathematics" will organize a "School of Formalized Mathematics" (May 13 - 17, 2024). This is targeted towards junior researchers and mathematicians with little prior exposure to Formalization and Automated Theorem Proving and any others who are interested in this technology. Prospective participants can still apply at [1] DEADLINE: Jan. 31. 2024 (CET). At the school the major theorem proving systems and libraries are introduced by their developers. We envision it to be quite informal, hands-on, and interactive. We plan to have plenary sessions in the mornings 9-11 on Monday May 13 to introduce the systems in a ca. 20 min lightning talks, and in the remaining days present specific aspects of general interest of the systems (please volunteer two topics) in 40 min presentations. In the afternoons we will form small groups that get their hands dirty in specific formalization projects. [1] https://urldefense.com/v3/__https://him-application.uni-bonn.de/index.php?id=5960__;!!IBzWLUs!S4GFlNH-BN5ckZa_z_HWmNS1i4qn-egIpHmzc8oWbUGGvdYdLJrq-pLNhWTJd-CvXy5JYhmqz48uXV7Dynor11amN0EhIMdgX_c2eKYY$ -- Valeria de Paiva https://urldefense.com/v3/__http://vcvpaiva.github.io/__;!!IBzWLUs!S4GFlNH-BN5ckZa_z_HWmNS1i4qn-egIpHmzc8oWbUGGvdYdLJrq-pLNhWTJd-CvXy5JYhmqz48uXV7Dynor11amN0EhIMdgX1ceZLAg$ https://urldefense.com/v3/__https://topos.institute/__;!!IBzWLUs!S4GFlNH-BN5ckZa_z_HWmNS1i4qn-egIpHmzc8oWbUGGvdYdLJrq-pLNhWTJd-CvXy5JYhmqz48uXV7Dynor11amN0EhIMdgX_Q5TF47$ https://urldefense.com/v3/__http://www.cs.bham.ac.uk/*vdp/__;fg!!IBzWLUs!S4GFlNH-BN5ckZa_z_HWmNS1i4qn-egIpHmzc8oWbUGGvdYdLJrq-pLNhWTJd-CvXy5JYhmqz48uXV7Dynor11amN0EhIMdgX_9veDBf$
