[TYPES/announce] Mathematically Structured Functional Programming 2018: Final Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Seventh Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING Sunday 8th July 2018, Oxford, UK A satellite workshop of FSCD 2018 http://msfp2018.bentnib.org/ ** New this time: additional talk proposal category ** ** Deadline: 5th April (abstract), 12th April (paper) ** The seventh workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The fifth workshop was held in Grenoble, France, as part of ETAPS 2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven, Netherlands, just after ETAPS 2016. Important Dates: Abstract deadline: 5th April (Thursday) Paper deadline:12th April (Thursday) Notification: 17th May (Thursday) Final version: 14th June (Thursday) Workshop: 8th July (Sunday) Invited Speakers: = - Tamara von Glehn, University of Cambridge, UK - Didier Remy, INRIA, France Program Committee: == Andreas Abel - Chalmers, Sweden Danel Ahman - INRIA Paris, France Robert Atkey - University of Strathclyde, UK (co-chair) Jeremy Gibbons- University of Oxford, UK Jennifer Hackett - University of Nottingham, UK Mauro Jaskelioff - Universidad Nacional de Rosario, Argentina Shin-ya Katsumata - National Institute of Informatics, Japan Sam Lindley - University of Edinburgh, UK (co-chair) Clare Martin - Oxford Brookes University, UK Shin-Cheng Mu - Academia Sinica, Taiwan Valeria de Paiva - Nuance Communications, US Alexandra Silva - University College London, UK Submission: === Submissions are welcomed on, but by no means restricted to, topics such as: structured effectful computation structured recursion structured corecursion structured tree and graph operations structured syntax with variable binding structured datatype-genericity structured search structured representations of functions structured quantum computation structure directed optimizations structured types structure derived from programs and data Please contact the programme chairs Robert Atkey and Sam Lindley if you have any questions about the scope of the workshop. (New this time) We accept two categories of submission: full papers of no more than 15 pages that will appear in the proceedings, and extended abstracts of no more than 2 pages which we will post on the website, but which do not constitute formal publications and will not appear in the proceedings. References and appendices are not included in page limits. Appendices may not be read by reviewers. Full papers (not two page talk abstracts) must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers and talks must be presented at the workshop by at least one of the authors. The proceedings will be published under the auspices of EPTCS with a Creative Commons license. We are using EasyChair to manage submissions. To submit a paper, use this link: https://easychair.org/conferences/?conf=msfp2018.
[TYPES/announce] Postdoc position in Logic, Gothenburg (Sweden), Deadline: 31st May 2018
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] POSTDOC POSITION IN LOGIC, GOTHENBURG (SWEDEN) * University of Gothenburg, Sweden * Duration: 2 years, starting Autumn 2018 * Deadline for applications is 31st May 2018 * The Department of Philosophy, Linguistics and Theory of Science at University of Gothenburg is inviting applications for a Postdoc position in Logic. Topics of interest include proof-theoretic studies of reflection and induction, axiomatic theories of truth, type-theoretic foundations, and fixed-point calculi such as the modal mu-calculus. * For full details see http://www.gu.se/english/about_the_university/job-opportunities/vacancies-details/?id=1637
[TYPES/announce] Upcoming Deadline for SAS 2018: April 13th
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] - SAS 2018 25th Static Analysis Symposium Freiburg im Breisgau, Germany, August 29th-August 31st, 2018 http://staticanalysis.org/sas2018 - = = = The submission deadline has been moved to April 13th, 2018 = = = Objective Static Analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. The 25th Static Analysis Symposium, SAS 2018, will be held in Freiburg im Breisgau, Germany. Previous symposia were held in New York, Edinburgh, Saint-Malo, Munich, Seattle, Deauville, Venice, Perpignan, Los Angeles, Valencia, Kongens Lyngby, Seoul, London, Verona, San Diego, Madrid, Paris, Santa Barbara, Pisa, Aachen, Glasgow, and Namur. The proceedings of the conference will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of the Springer Lecture Notes in Computer Science (LNCS) series. Topics The technical program for SAS 2018 will consist of invited lectures and presentations of refereed papers. Contributions are welcomed on all aspects of static analysis, including, but not limited to: - Abstract domains - Abstract interpretation - Automated deduction - Data flow analysis - Debugging - Deductive methods - Emerging applications - Model checking - Program optimization and transformation - Program synthesis - Program verification - Security analysis - Tool environments and architectures - Theoretical frameworks - Type checking Paper Submission Submissions can address any programming paradigm including concurrent, constraint, functional, imperative, logic, object-oriented, aspect, multi-core, distributed, and GPU programming. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Paper submissions should not exceed 15 pages in Springer's Lecture Notes in Computer Science LNCS format, excluding bibliography and well-marked appendices (we may admit additional pages for the final version). Program Committee members are not required to read the appendices, and thus papers must be intelligible without them. Submissions are handled online: https://easychair.org/conferences/?conf=sas20180 Artifact Evaluation As in previous years, we are encouraging authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. The goal of the artifact submissions is to strengthen our field's scientific approach to evaluations and reproducibility of results. The virtual machines will be archived on a permanent Static Analysis Symposium website to provide a record of past experiments and tools, allowing future research to better evaluate and contrast existing work. Artifact submission is optional. We accept only virtual machine images that can be processed with Virtual Box. Details on what to submit and how will be sent to the corresponding authors by mail shortly after the paper submission deadline. The submitted artifacts will be used by the program committee as a secondary evaluation criterion whose sole purpose is to find additional positive arguments for the paper's acceptance. Furthermore, an Artifact Evaluation Committee will assess artifacts and will award an "Artifact Approved" stamps to accepted papers that come with an artifact that allows to reproduce the results presented in the paper. Submissions without artifacts are welcome and will not be penalized. Important Dates - Full paper submission: April 13th, 2018 (anywhere on earth) - Artifact submission: April 20th, 2018 (anywhere on earth) - Notification: June 5th, 2018 - Final version due: July 6th, 2018 - Conference: August 29th-August 31st, 2018 Radhia Cousot Young Researcher Award Since 2014, the program committee of each SAS conference selects a paper for the Radhia Cousot Young Researcher Best Paper Award, in memory of Radhia Cousot, and her fundamental contributions to static analysis, as well as being one of the main promoters and organizers of the SAS series of conferences. Invited Talks - Aws Albarghouthi (University of Wisconsin-Madison, USA) Program Fairness through the
[TYPES/announce] LOLA 2018: Second Call-for-Proposals
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] LOLA 2018: Syntax and Semantics of Low-Level Languages = Saturday, 7 July 2018, Oxford, United Kingdom A satellite workshop of LICS 2018 at FLoC 2018 https://cs.appstate.edu/~johannp/lola18/ Important dates - LOLA submission deadline 15 April 2018 Notification 13 May 2018 Early Registration Deadline6 June 2018 Workshop 7 July 2018 - Submission: https://easychair.org/conferences/?conf=lola2018 Registration: http://www.floc2018.org/register/ Invited Speakers Nada Amin, University of Cambridge https://www.cl.cam.ac.uk/~na482/ Nick Benton, Facebook Research https://research.fb.com/people/benton-nick/ Context --- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of the past two decades has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS at FLoC 2018, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: * Typed assembly languages, * Certified assembly programming, * Certified and certifying compilation, * Proof-carrying code, * Program optimization, * Modal logic and realizability in machine code, * Realizability and double orthogonality in assembly code, * Parametricity, modules and existential types, * General references, Kripke models and recursive types, * Continuations and concurrency, * Resource analysis and implicit complexity, * Closures and explicit substitutions, * Linear logic and separation logic, * Game semantics, abstract machines and hardware synthesis, * Monoidal and premonoidal categories, traces and effects. Submission -- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a two page abstract or of a longer (published or unpublished) paper describing completed work. Authors are invited to submit their contribution by 15 April 2018. Abstracts must be written in English and be submitted as a single PDF file at EasyChair: https://easychair.org/conferences/?conf=lola2018 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. At least one author of an accepted workshop proposal must be registered for the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Program Committee - * Zena Ariola, University of Oregon * Valentin Blot,Universite Paris-Sud * Karl Crary, Carnegie Mellon University * Patricia Johann, Appalachian State University (co-chair) * Ohad Kammar, University of Oxford (co-chair) * Andrew Kennedy, Facebook * Ori Lahav,Tel Aviv University * Jim Laird,University of Bath * Rasmus Mogelberg, IT University Copenhagen * Dave Naumann, Stevens University of Technology * Azalea Raad, MPI-SWS * Christine Rizkallah, University of Pennsylvania * Claudio Russo,Microsoft
[TYPES/announce] LSFA 2018, 2nd CfP
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] SECOND CALL FOR PAPERS LSFA 2018 13th Workshop on Logical and Semantic Frameworks, with Applications 26-28 September 2018, Fortaleza, Brazil http://lia.ufc.br/~lsfa2018/ https://easychair.org/cfp/LSFA2018 Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and programming languages, supporting tool development and reasoning. Previous editions took place in Brasília (2017, collocated with Tableaux+FroCoS+ITP), Porto (2016), Natal (2015), Brasília (2014), São Paulo (2013), Rio de Janeiro (2012), Belo Horizonte (2011), Natal (2010), Brasília (2009), Salvador (2008), Ouro Preto (2007), and Natal (2006). See http://lsfa.cic.unb.br for more information. TOPICS OF INTEREST Topics of interest include, but are not limited to: * Automated deduction * Applications of logical and/or semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and/or semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory SUBMISSION AND PUBLICATION Contributions should be written in English and submitted in the form of full papers with a maximum of 13 pages (including references) in the new ENTCS format (http://www.entcs.org/generic.zip). Beyond full regular papers, we encourage submissions such as proof pearls, rough diamonds, original surveys, or overviews of research projects, where the focus is more on elegance and dissemination than on novelty. Papers belonging to this second category are expected to be short, that is, of a maximum of 6 pages including references, unless they also contain some novel results. For both paper categories, additional technical material can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Contributions must also be unpublished and not submitted simultaneously for publication elsewhere. Papers should be prepared in LaTeX using the generic ENTCS package (http://www.entcs.org/generic.zip). The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2018 The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. After the workshop the authors of both full and short papers will be invited to submit full versions of their works for the post-proceedings to be published in ENTCS. At least one of the authors should register for the conference. For the reviewing process, the traditional system will be enriched with the possibility for the reviewers to interact with the authors via an anonymous forum associated to each paper. IMPORTANT DATES: * Submission: June 10 * Notification: July 25 * Camera ready version: August 12 * LSFA 2018: September 26-28 After the publication of the ENTCS proceedings, the authors of selected papers will be invited to submit revised papers for a special issue. Previous LSFA special issues have been published in journals such as J. IGPL and TCS (see http://lsfa.cic.unb.br). INVITED SPEAKERS * Yiannis Moschovakis, University of California, Los Angeles & University of Athens. * Andreas Herzig, CNRS, IRIT, Université de Toulouse. * Alessandra Palmigiano, Delft University of Technology. * Amy Felty, University of Ottawa. PROGRAMME COMMITTEE * Beniamino Accattoli, Inria & Ecole Polytechnique, co-chair * Carlos Olarte, Universidade Federal do Rio Grande do Norte, co-chair * Sandra Alves, University of Porto * Mario Alvim, Universidade Federal de Minas Gerais * Carlos Areces, Universidad Nacional de Córdoba * Mauricio Ayala-Rincon, Universidade de Brasilia * Eduardo Bonelli, Universidad Nacional de Quilmes & Stevens Institute of Technology * Iliano Cervesato, Carnegie Mellon University * Francicleber Ferreira, Universidade Federal do Ceará * Marcelo Finger, Universidade de São Paulo * Renata Freitas, Universidade Federal Fluminense * Marco Gaboardi, University at Buffalo, SUNY * Erich Grädel, RWTH Aachen University * Oleg Kiselyov, Tohoku University * Ugo Dal Lago, Inria & Bologna University * Sonia Marin, IT-University of Copenhagen * Claudia Nalon, Universidade de Brasilia * Revantha Ramanayake, Vienna University of Technology * Umberto Rivieccio, Universidade Federal do Rio Grande do Norte * Camilo Rueda, Pontificia Universidad Javeriana * Matthieu Sozeau, Inria & Université Paris Diderot * Carolyn Talcott, SRI International * Alvaro Tasistro, Universidad ORT Uruguay * Alicia Villanueva, Universitat Politècnica de València * Renata Wassermann, University of São Paulo ORGANISING COMMITTEE *
