[TYPES/announce] PPDP | LOPSTR | WFLP 2018 Common Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == PPDP | LOPSTR | WFLP 2018: Common Call for Participation == 20th International Symposium on Principles and Practice of Declarative Programming (PPDP 2018) 28th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2018) 26th International Workshop on Functional and Logic Programming (WFLP 2018) Frankfurt am Main, Germany, 3-6 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de == Program === The full program of PPDP | LOPSTR | WFLP 2018 is online: http://ppdp-lopstr-18.cs.uni-frankfurt.de/program/0.htm It includes * four invited talks: - Philippa Gardner, Imperial College. Formal Methods for JavaScript - Jorge Navas, SRI International. Constrained Horn Clauses for Verification - Chung-Chieh Shan, University of Indiana. Calculating Distributions - Laure Gonnord, University of Lyon. Experiences in Designing Scalable Static Analyses * invited tutorials: LOPSTR includes two invited tutorials: - Fabio Fioravanti, University of Chieti-Pescara. The VeryMAP System for program transformation and verification - Manuel Hermenegildo, IMDEA Software Institute. 25 Years of Ciao * a session in Honour of Martin Hofmann PPDP includes a session in honour of Martin Hofmann with an invited talk given by Nick Benton, Facebook. Semantic Equivalence Checking for HHVM Bytecode Registration http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/#registration Early registration ends on 15 August, 2018. Sponsors The conferences are financially supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 407531063, and by the Goethe-University Frankfurt am Main. Conference Organisers = PPDP Program Committee See http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html#pc Program Chair Peter Thiemann, Universität Freiburg, Germany LOPSTR Program Committee See http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html#pc Program Chairs Fred Mesnard, University of Reunion Island, France Peter Stuckey, University of Melbourne, Australia WFLP Program Committee See http://ppdp-lopstr-18.cs.uni-frankfurt.de/wflp18.html#pc Program Chair Josep Silva, Universitat Politècnica de València, Spain Organizing Committee (Goethe-University Frankfurt am Main, Germany) Ehud Cseresnyes Nils Dallmeyer Bircan Dölek Ronja Düffel Lars Huth Leonard Priester David Sabel (General Chair)
[TYPES/announce] PPDP 2018: Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == PPDP 2018: Call for Participation == 20th International Symposium on Principles and Practice of Declarative Programming Frankfurt am Main, Germany, 3-5 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html (co-located with LOPSTR 2018 and WFLP 2018) http://ppdp-lopstr-18.cs.uni-frankfurt.de == Registration http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/#registration Early registration ends on 15 August, 2018. Session in Honour of Martin Hofmann === PPDP will include a session in honour of Martin Hofmann including a talk given by Nick Benton, Facebook on Semantic Equivalence Checking for HHVM Bytecode Invited Talks = - Philippa Gardner, Imperial College. Testing and Verification for JavaScript (joint with LOPSTR) - Jorge Navas, SRI International. Constrained Horn Clauses for Verification (joint with LOPSTR) - Chung-Chieh Shan, University of Indiana. Calculating Distributions Accepted Papers === - Maciej Bendkowski and Pierre Lescanne. Combinatorics of explicit substitutions - Manfred Schmidt-Schauss, David Sabel and Nils Dallmeyer. Sequential and Parallel Improvements in a Concurrent Functional Programming Language - Magnus Madsen and Ondrej Lhotak. Implicit Parameters for Logic Programming - Mistral Contrastin, Dominic Orchard and Andrew Rice. Automatic reordering for dataflow safety of Datalog - Danil Annenkov and Martin Elsman. Certified Compilation of Financial Contracts - José Fragoso Santos, Petar Maksimović, Théotime Grohens, Julian Dolby and Philippa Gardner. Cosette: Symbolic Execution for JavaScript - Michael Hanus. Verifying Fail-Free Declarative Programs - Dmitri Rozplokhas and Dmitry Boulytchev. Improving Refutational Completeness of Relational Search via Divergence Test - Martin Sulzmann and Kai Stadtmüller. Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks - Sylvia Grewe, Sebastian Erdweg, André Pacak and Mira Mezini. An Infrastructure for Combining Domain Knowledge with Automated Theorem Provers - Gopalan Nadathur and Yuting Wang. Schematic Polymorphism in the Abella Proof Assistant - Stephan Adelsberger, Anton Setzer and Eric Walkingshaw. Declarative GUIs: Simple, Consistent, and Verified - Genki Sakanashi and Masahiko Sakai. Transformation of combinatorial optimization problems written in extended SQL into constraint problems - Yuki Nishida and Atsushi Igarashi. Nondeterministic Manifest Contracts - Alberto Pardo, Emmanuel Gunther, Miguel Pagano and Marcos Viera. An Internalist Approach to Correct-by-Construction Compilers - Falco Nogatz, Jona Kalkus and Dietmar Seipel. Web-based Visualisation for Definite Clause Grammars using Prolog Meta-Interpreters - Helmut Seidl and Ralf Vogler. Three improvements to the top-down solver - Flavien Breuvart and Ugo Dal Lago. On Intersection Types and Probabilistic Lambda Calculi - Taku Terao. Lazy Abstraction for Higher-Order Program Verification - Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, Jose F. Morales and Manuel V. Hermenegildo. Static Performance Guarantees for Programs with Run-time Checks - Abhishek Dang and Piyush Kurur. Verse: An EDSL for cryptographic primitives - Pablo Barenbaum, Eduardo Bonelli and Kareem Mohamed. Pattern Matching and Fixed Points: Resources Types and Strong Call-By-Need Sponsors PPDP is financially supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 407531063, and by the Goethe-University Frankfurt am Main. Conference Organisers = Program Committee See http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html#pc Program Chair Peter Thiemann, Universität Freiburg, Germany Organizing Committee (Goethe-University Frankfurt am Main, Germany) Ehud Cseresnyes Nils Dallmeyer Bircan Dölek Ronja Düffel Lars Huth Leonard Priester David Sabel (General Chair)
[TYPES/announce] Second round call for papers: LOPSTR 2018
- SeaHorn and constrained horn clauses for verification LOPSTR: Laure Gonnord, University of Lyon - expressivity and scalability of program analysis PPDP: Chung-Chieh Shan, Indiana University - probabilistic programming Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Program Committee See http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html#pc Program Chairs Fred Mesnard, University of Reunion Island, France Peter Stuckey, University of Melbourne, Australia Organizing Committee David Sabel (General Chair), Computer Science Institute Goethe-University Frankfurt am Main, Germany
[TYPES/announce] PPDP 2018: Deadline Extension!
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] News: The submission deadline is extended until Monday, May 8, 23:59 AoE! == PPDP 2018: Deadline Extension == 20th International Symposium on Principles and Practice of Declarative Programming Frankfurt am Main, Germany, 3-5 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html (co-located with LOPSTR 2018 and WFLP 2018) http://ppdp-lopstr-18.cs.uni-frankfurt.de == Invited Talks = - Philippa Gardner, Imperial College: Testing and Verification for JavaScript (joint with LOPSTR) - Jorge Navas, SRI International: Constrained Horn Clauses for Verification (joint with LOPSTR) - Chung-Chieh Shan, University of Indiana: Calculating Distributions Scope = The PPDP 2018 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism, and distribution; modules; probabilistic languages; reactive languages; database languages; knowledge representation languages; languages with objects; language extensions for tabulation; metaprogramming. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. PPDP will be co-located with the 28th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2018). Submission Categories = Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Possible topics for an Experience Report include, but are not limited to: insights gained from real-world projects using declarative programming comparison of declarative programming with conventional programming in the context of an industrial project or a university curriculum curricular issues encountered when using declarative programming in education real-world constraints that created special challenges for an implementation of a declarative language or
[TYPES/announce] PPDP 2018: Second Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == PPDP 2018: Second Call for Papers == 20th International Symposium on Principles and Practice of Declarative Programming Frankfurt am Main, Germany, 3-5 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html (co-located with LOPSTR 2018 and WFLP 2018) http://ppdp-lopstr-18.cs.uni-frankfurt.de == Invited Talks (NEW!) - Philippa Gardner, Imperial College: Testing and Verification for JavaScript (joint with LOPSTR) - Jorge Navas, SRI International: Constrained Horn Clauses for Verification (joint with LOPSTR) - Chung-Chieh Shan, University of Indiana: Calculating Distributions Scope = The PPDP 2018 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism, and distribution; modules; probabilistic languages; reactive languages; database languages; knowledge representation languages; languages with objects; language extensions for tabulation; metaprogramming. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. PPDP will be co-located with the 28th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2018). Submission Categories = Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Possible topics for an Experience Report include, but are not limited to: insights gained from real-world projects using declarative programming comparison of declarative programming with conventional programming in the context of an industrial project or a university curriculum curricular issues encountered when using declarative programming in education real-world constraints that created special challenges for an implementation of a declarative language or for declarative programming in general novel use of
[TYPES/announce] PPDP 2018: First Call for Papers
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] == PPDP 2018: First Call for Papers == 20th International Symposium on Principles and Practice of Declarative Programming Frankfurt am Main, Germany, 3-5 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html Frankfurt, Germany, September 4-6, 2018 (co-located with LOPSTR 2018 and WFLP 2018) == The PPDP 2018 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Submissions are invited on all topics related to declaractive programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism, and distribution; modules; probabilistic languages; reactive languages; database languages; knowledge representation languages; languages with objects; language extensions for tabulation; metaprogramming. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. PPDP will be co-located with the 28th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2018). Submission Categories = Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Possible topics for an Experience Report include, but are not limited to: insights gained from real-world projects using declarative programming comparison of declarative programming with conventional programming in the context of an industrial project or a university curriculum curricular issues encountered when using declarative programming in education real-world constraints that created special challenges for an implementation of a declarative language or for declarative programming in general novel use of declarative programming in the classroom programming pearl that illustrates a nifty new data structure or programming technique. Supplementary material may be provided in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study any material beyond the respective page limit. Format of a submission
[TYPES/announce] Deadline extension: WPTE 2017 Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR PAPERS Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation WPTE 2017 affiliated with FSCD 2017 8 September, 2017, Oxford, UK http://www.ki.informatik.uni-frankfurt.de/WPTE17 Aims and Scope == The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally-based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The previous WPTE were held in Vienna 2014, in Warsaw 2015, and in Porto 2016. Topics of interest in the scope of this workshop include: * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for reasoning about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and Rewriting. The programming languages of interest include pure, deterministic, impure, nondeterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order. Invited Speaker === Joachim Breitner(University of Pennsylvania, USA) Paper Submissions = For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. However, for the formal post-proceedings (see below) full papers must be submitted to the post-proceedings deadline. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). Formal Post-Proceedings === The WPTE post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). The authors of all presented contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These full-papers must represent original work and should not be submitted to another conference at the same time. Full-papers should not exceed 15 pages. The submission deadline for these post-proceedings will be after the workshop in October 2017. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Important Dates === * Submission deadline (extended abstracts): July 21th, 2017 (Extended!) * Notification of acceptance:August 4th, 2017 * Deadline for participant proceedings: August 11th, 2017 * Workshop: September 8th, 2017 * Submission deadline for post proceedings (full-papers): October, 2017 (exact date to be announced) Weblinks * EasyChair Submission Website https://easychair.org/conferences/?conf=wpte2017 * Homepage of WPTE 2017 http://www.ki.informatik.uni-frankfurt.de/WPTE17/ * FSCD 2017 http://www.cs.ox.ac.uk/conferences/fscd2017/ Program Committee = Beniamino Accattoli (INRIA) Martin Avanzini (University of Innsbruck) Yuki Chiba (JAIST) Horatiu Cirstea (LORIA, Université de Lorraine) -- chair Santiago Escobar (Universitat Politècnica de València) Maribel Fernandez (KCL) Delia Kesner (Université Paris-Diderot) Sergueï Lenglet (Université de Lorraine) Elena Machkasova (University of Minnesota, Morris) William Mansky (Princeton University) Joachim Niehren (INRIA Lille) Naoki Nishida (Nagoya University) David Sabel (Goethe-University Frankfurt am Main) -- chair Masahiko Sakai
[TYPES/announce] Final Call for Papers: WPTE 2017 Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation WPTE 2017 affiliated with FSCD 2017 8 September, 2017, Oxford, UK http://www.ki.informatik.uni-frankfurt.de/WPTE17 Important Dates === * Submission deadline (extended abstracts): July 14th, 2017 * Notification of acceptance:August 4th, 2017 * Deadline for participant proceedings: August 11th, 2017 * Workshop: September 8th, 2017 * Submission deadline for post proceedings (full-papers): October, 2017 (exact date to be announced) Aims and Scope == The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally-based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The previous WPTE were held in Vienna 2014, in Warsaw 2015, and in Porto 2016. Topics of interest in the scope of this workshop include: * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for reasoning about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and Rewriting. The programming languages of interest include pure, deterministic, impure, nondeterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order. Invited Speaker === Joachim Breitner(University of Pennsylvania, USA) Paper Submissions = For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. However, for the formal post-proceedings (see below) full papers must be submitted to the post-proceedings deadline. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). Formal Post-Proceedings === The WPTE post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). The authors of all presented contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These full-papers must represent original work and should not be submitted to another conference at the same time. Full-papers should not exceed 15 pages. The submission deadline for these post-proceedings will be after the workshop in October 2017. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Weblinks * EasyChair Submission Website https://easychair.org/conferences/?conf=wpte2017 * Homepage of WPTE 2017 http://www.ki.informatik.uni-frankfurt.de/WPTE17/ * FSCD 2017 http://www.cs.ox.ac.uk/conferences/fscd2017/ Program Committee = Beniamino Accattoli (INRIA) Martin Avanzini (University of Innsbruck) Yuki Chiba (JAIST) Horatiu Cirstea (LORIA, Université de Lorraine) -- chair Santiago Escobar (Universitat Politècnica de València) Maribel Fernandez (KCL) Delia Kesner (Université Paris-Diderot) Sergueï Lenglet (Université de Lorraine) Elena Machkasova (University of Minnesota, Morris) William Mansky (Princeton University) Joachim Niehren (INRIA Lille) Naoki Nishida (Nagoya University) David Sabel (Goethe-University Frankfurt am Main) -- chair Masahiko Sakai (Graduate School of Infomation Science, Nagoya
[TYPES/announce] CFP: WPTE 2017 Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR PAPERS Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation WPTE 2017 affiliated with FSCD 2017 8 September, 2017, Oxford, UK http://www.ki.informatik.uni-frankfurt.de/WPTE17 Aims and Scope == The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally-based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The previous WPTE were held in Vienna 2014, in Warsaw 2015, and in Porto 2016. Topics of interest in the scope of this workshop include: * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for reasoning about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and Rewriting. The programming languages of interest include pure, deterministic, impure, nondeterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order. Invited Speaker === Joachim Breitner(University of Pennsylvania, USA) Paper Submissions = For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. However, for the formal post-proceedings (see below) full papers must be submitted to the post-proceedings deadline. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). Formal Post-Proceedings === The WPTE post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). The authors of all presented contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These full-papers must represent original work and should not be submitted to another conference at the same time. Full-papers should not exceed 15 pages. The submission deadline for these post-proceedings will be after the workshop in October 2017. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Important Dates === * Submission deadline (extended abstracts): July 14th, 2017 * Notification of acceptance:August 4th, 2017 * Deadline for participant proceedings: August 11th, 2017 * Workshop: September 8th, 2017 * Submission deadline for post proceedings (full-papers): October, 2017 (exact date to be announced) Weblinks * EasyChair Submission Website https://easychair.org/conferences/?conf=wpte2017 * Homepage of WPTE 2017 http://www.ki.informatik.uni-frankfurt.de/WPTE17/ * FSCD 2017 http://www.cs.ox.ac.uk/conferences/fscd2017/ Program Committee = Beniamino Accattoli (INRIA) Martin Avanzini (University of Innsbruck) Yuki Chiba (JAIST) Horatiu Cirstea (LORIA, Université de Lorraine) -- chair Santiago Escobar (Universitat Politècnica de València) Maribel Fernandez (KCL) Delia Kesner (Université Paris-Diderot) Sergueï Lenglet (Université de Lorraine) Elena Machkasova (University of Minnesota, Morris) William Mansky (Princeton University) Joachim Niehren (INRIA Lille) Naoki Nishida (Nagoya University) David Sabel (Goethe-University Frankfurt am Main) -- chair Masahiko Sakai
