BOB has a strong emphasis on functional programming - OCamlers very welcome!
================================================================================
BOB 2019
Conference
"What happens if we simply use what's best?"
March 22, 2019, Berlin
http://bobkonf.de/2019/
Program: http://bobkonf.de/2019/en/program.html
Registration: http://bobkonf.de/2019/en/registration.html
================================================================================
BOB is the conference for developers, architects and decision-makers
to explore technologies beyond the mainstream in software development,
and to find the best tools available to software developers today. Our
goal is for all participants of BOB to return home with new insights
that enable them to improve their own software development
experiences.
The program features 14 talks and 8 tutorials on current topics:
http://bobkonf.de/2019/en/program.html
The subject range of talks includes functional programming, formal
methods, event sourcing, music, advanced SQL, logic, and feeling
The tutorials feature introductions to Racket, Clojure, Functional
Programming, TypeScript, type-level programming, SQL indexing,
probabilistic programming, and hardware.
Gabriele Keller will give the keynote talk.
Registration is open online:
http://bobkonf.de/2019/en/registration.html
NOTE: The early-bird rates expire on February 19, 2019!
BOB cooperates with the RacketFest conference on the following day:
https://racketfest.com/
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
2018-12-10
[Caml-list] Call for Papers: JLAMP Special Issue on Relational and Algebraic Methods in Computer Science
OPEN CALL FOR PAPERS FOR JOURNAL SPECIAL ISSUE
Relational and Algebraic Methods in Computer Science
Special Issue of the
Journal of Logical and Algebraic Methods in Programming (JLAMP)
http://www.ramics-conference.org/ramics-2018-jlamp-cfp.pdf
IMPORTANT DATES:
Submission Deadline: 31 March 2019
Notification of Acceptance: late 2019/early 2020
TOPICS:
Relational and algebraic methods belong to the core of computer science.
This special issue aims to showcase the variety and relevance of recent
developments in this field ranging from theory to applications.
We invite submissions of high-quality original research articles in the
general fields of algebras relevant to computer science and applications
of such algebras. Topics include but are not limited to:
* Theory
- algebras such as semigroups, residuated lattices, semirings,
Kleene algebras, relation algebras and quantales
- their connections with program logics and other logics
- their formalisation with theorem provers
- their use in the theories of automata, concurrency, formal languages,
games, networks and programming languages
- the development of algebraic, algorithmic, category-theoretic,
coalgebraic and proof-theoretic methods for these theories
* Applications
- tools and techniques for program correctness, specification and
verification
- quantitative and qualitative models and semantics of computing
systems and processes
- algorithm design, automated reasoning, network protocol analysis,
social choice, optimisation and control
- industrial applications
While we welcome substantially extended versions of papers published
in the proceedings of the RAMiCS 2018 conference (Springer LNCS 11194,
https://www.springer.com/gp/book/9783030021481), this call is open to
anyone interested in the field of relational and algebraic methods.
SUBMISSION INSTRUCTIONS:
All submissions will be evaluated solely with respect to their novelty,
significance and technical quality according to the high standards of
JLAMP. They must be in PDF format, adhere to the standard JLAMP guide
for authors
https://www.elsevier.com/journals/journal-of-logical-and-algebraic-methods-in-programming/2352-2208/guide-for-authors
and be uploaded on Elsevier's online EVISE system
https://www.evise.com/profile/#/JLAMP/login
selecting the issue type
VSI: RAMiCS 2018
Deviation from these requirements may lead to immediate rejection.
GUEST EDITORS:
Jules Desharnais (Université Laval, Québec, Canada)
Walter Guttmann (University of Canterbury, New Zealand)
Stef Joosten (Open University of the Netherlands)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
Relational and Algebraic Methods in Computer Science
Special Issue of the
Journal of Logical and Algebraic Methods in Programming (JLAMP)
http://www.ramics-conference.org/ramics-2018-jlamp-cfp.pdf
IMPORTANT DATES:
Submission Deadline: 31 March 2019
Notification of Acceptance: late 2019/early 2020
TOPICS:
Relational and algebraic methods belong to the core of computer science.
This special issue aims to showcase the variety and relevance of recent
developments in this field ranging from theory to applications.
We invite submissions of high-quality original research articles in the
general fields of algebras relevant to computer science and applications
of such algebras. Topics include but are not limited to:
* Theory
- algebras such as semigroups, residuated lattices, semirings,
Kleene algebras, relation algebras and quantales
- their connections with program logics and other logics
- their formalisation with theorem provers
- their use in the theories of automata, concurrency, formal languages,
games, networks and programming languages
- the development of algebraic, algorithmic, category-theoretic,
coalgebraic and proof-theoretic methods for these theories
* Applications
- tools and techniques for program correctness, specification and
verification
- quantitative and qualitative models and semantics of computing
systems and processes
- algorithm design, automated reasoning, network protocol analysis,
social choice, optimisation and control
- industrial applications
While we welcome substantially extended versions of papers published
in the proceedings of the RAMiCS 2018 conference (Springer LNCS 11194,
https://www.springer.com/gp/book/9783030021481), this call is open to
anyone interested in the field of relational and algebraic methods.
SUBMISSION INSTRUCTIONS:
All submissions will be evaluated solely with respect to their novelty,
significance and technical quality according to the high standards of
JLAMP. They must be in PDF format, adhere to the standard JLAMP guide
for authors
https://www.elsevier.com/journals/journal-of-logical-and-algebraic-methods-in-programming/2352-2208/guide-for-authors
and be uploaded on Elsevier's online EVISE system
https://www.evise.com/profile/#/JLAMP/login
selecting the issue type
VSI: RAMiCS 2018
Deviation from these requirements may lead to immediate rejection.
GUEST EDITORS:
Jules Desharnais (Université Laval, Québec, Canada)
Walter Guttmann (University of Canterbury, New Zealand)
Stef Joosten (Open University of the Netherlands)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
2018-11-28
[Caml-list] PEPM 2019 Call for Posters, Demos, and Participation
-- Call for Poster/Demo Abstracts and Participation --
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) 2019
===============================================================================
* Website : http://popl19.sigplan.org/track/pepm-2019-papers
* Time : 14th – 15th January 2019
* Place : Cascais/Lisbon, Portugal (co-located with POPL 2019)
POSTER/DEMO SESSIONS: PEPM 2019 is accepting proposals for poster/demo
presentations on a rolling basis, until 14th December (AoE). See
below for the submission guidelines.
Registration
------------
* Web page : https://popl19.sigplan.org/attending/Registration
* Early registration deadline : 10th December 2018
Accepted papers
---------------
Reduction from Branching-time Property Verification of Higher-Order Programs to HFL Validity Checking
Keiichi Watanabe, Takeshi Tsukada, Hiroki Oshikawa, Naoki Kobayashi
Generating mutually recursive definitions
Jeremy Yallop, Oleg Kiselyov
Method Name Suggestion with Hierarchical Attention Networks
Sihan Xu, Xinya Cao, Jing Xu
Futures and Promises in Haskell and Scala
Tamino Dauth, Martin Sulzmann
Combining Higher-Order Model Checking with Refinement Type Inference
Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi
Typed parsing and unparsing for untyped regular expression engines
Gabriel Radanne
Control Flow Obfuscation via CPS Transformation
Kenny Zhuo Ming Lu
Extracting a Partial Evaluator from a Proof of Termination
Kenichi Asai
A Simpler Lambda Calculus
Barry Jay
Poster/demo abstract submission guideline
-----------------------------------------
* https://popl19.sigplan.org/track/pepm-2019-papers#Call-for-Poster-Demo-Abstracts
To maintain PEPM's dynamic and interactive nature, PEPM 2019 will continue to
have special sessions for poster/demo presentations. In addition to the main
interactive poster/demo session, there will also be a scheduled short-talk
session where each poster/demo can be advertised to the audience in, say, 5–10
minutes.
Poster/demo abstracts should describe work relevant to PEPM (whose scope is
detailed below), typeset as a one-page PDF using the two-column 'sigplan'
sub-format of the new 'acmart' format available at:
http://sigplan.org/Resources/Author/
and sent by email to the programme co-chairs, Manuel Hermenegildo and Atsushi Igarashi, at:
manuel.hermenegildo@imdea.org, igarashi@kuis.kyoto-u.ac.jp
Please also include in the email:
* a short summary of the abstract (in plain text),
* the type(s) of proposed presentation (poster and/or demo), and
* whether you would like to give a scheduled short talk (in addition to the
poster/demo presentation).
Abstracts should be sent no later than:
Friday, 14th December 2018, anywhere on earth
and will be considered for acceptance on a rolling basis. Accepted abstracts,
along with their short summary, will be posted on PEPM 2019's website.
At least one author of each accepted abstract must attend the workshop and
present the work during the poster/demo session.
Student participants with accepted posters/demos can apply for a SIGPLAN PAC
grant to help cover travel expenses and other support. PAC also offers other
support, such as for child-care expenses during the meeting or for travel costs
for companions of SIGPLAN members with physical disabilities, as well as for
travel from locations outside of North America and Europe. For details on the
PAC programme, see its web page.
Scope
-----
In addition to the traditional PEPM topics (see below), PEPM 2019 welcomes
submissions in new domains, in particular:
* Semantics based and machine-learning based program synthesis and program
optimisation.
* Modelling, analysis, and transformation techniques for distributed and
concurrent protocols and programs, such as session types, linear types, and
contract specifications.
More generally, topics of interest for PEPM 2019 include, but are not limited
to:
* Program and model manipulation techniques such as: supercompilation,
partial evaluation, fusion, on-the-fly program adaptation, active
libraries, program inversion, slicing, symbolic execution, refactoring,
decompilation, and obfuscation.
* Techniques that treat programs/models as data objects including
metaprogramming, generative programming, embedded domain-specific
languages, program synthesis by sketching and inductive programming, staged
computation, and model-driven program generation and transformation.
* Program analysis techniques that are used to drive program/model
manipulation such as: abstract interpretation, termination checking,
binding-time analysis, constraint solving, type systems, automated testing
and test case generation.
* Application of the above techniques including case studies of program
manipulation in real-world (industrial, open-source) projects and software
development processes, descriptions of robust tools capable of effectively
handling realistic applications, benchmarking. Examples of application
domains include legacy program understanding and transformation, DSL
implementations, visual languages and end-user programming, scientific
computing, middleware frameworks and infrastructure needed for distributed
and web-based applications, embedded and resource-limited computation, and
security.
This list of categories is not exhaustive, and we encourage submissions
describing new theories and applications related to semantics-based program
manipulation in general. If you have a question as to whether a potential
submission is within the scope of the workshop, please contact the programme
co-chairs, Manuel Hermenegildo and Atsushi Igarashi (manuel.hermenegildo@imdea.org, igarashi@kuis.kyoto-u.ac.jp).
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) 2019
===============================================================================
* Website : http://popl19.sigplan.org/track/pepm-2019-papers
* Time : 14th – 15th January 2019
* Place : Cascais/Lisbon, Portugal (co-located with POPL 2019)
POSTER/DEMO SESSIONS: PEPM 2019 is accepting proposals for poster/demo
presentations on a rolling basis, until 14th December (AoE). See
below for the submission guidelines.
Registration
------------
* Web page : https://popl19.sigplan.org/attending/Registration
* Early registration deadline : 10th December 2018
Accepted papers
---------------
Reduction from Branching-time Property Verification of Higher-Order Programs to HFL Validity Checking
Keiichi Watanabe, Takeshi Tsukada, Hiroki Oshikawa, Naoki Kobayashi
Generating mutually recursive definitions
Jeremy Yallop, Oleg Kiselyov
Method Name Suggestion with Hierarchical Attention Networks
Sihan Xu, Xinya Cao, Jing Xu
Futures and Promises in Haskell and Scala
Tamino Dauth, Martin Sulzmann
Combining Higher-Order Model Checking with Refinement Type Inference
Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi
Typed parsing and unparsing for untyped regular expression engines
Gabriel Radanne
Control Flow Obfuscation via CPS Transformation
Kenny Zhuo Ming Lu
Extracting a Partial Evaluator from a Proof of Termination
Kenichi Asai
A Simpler Lambda Calculus
Barry Jay
Poster/demo abstract submission guideline
-----------------------------------------
* https://popl19.sigplan.org/track/pepm-2019-papers#Call-for-Poster-Demo-Abstracts
To maintain PEPM's dynamic and interactive nature, PEPM 2019 will continue to
have special sessions for poster/demo presentations. In addition to the main
interactive poster/demo session, there will also be a scheduled short-talk
session where each poster/demo can be advertised to the audience in, say, 5–10
minutes.
Poster/demo abstracts should describe work relevant to PEPM (whose scope is
detailed below), typeset as a one-page PDF using the two-column 'sigplan'
sub-format of the new 'acmart' format available at:
http://sigplan.org/Resources/Author/
and sent by email to the programme co-chairs, Manuel Hermenegildo and Atsushi Igarashi, at:
manuel.hermenegildo@imdea.org, igarashi@kuis.kyoto-u.ac.jp
Please also include in the email:
* a short summary of the abstract (in plain text),
* the type(s) of proposed presentation (poster and/or demo), and
* whether you would like to give a scheduled short talk (in addition to the
poster/demo presentation).
Abstracts should be sent no later than:
Friday, 14th December 2018, anywhere on earth
and will be considered for acceptance on a rolling basis. Accepted abstracts,
along with their short summary, will be posted on PEPM 2019's website.
At least one author of each accepted abstract must attend the workshop and
present the work during the poster/demo session.
Student participants with accepted posters/demos can apply for a SIGPLAN PAC
grant to help cover travel expenses and other support. PAC also offers other
support, such as for child-care expenses during the meeting or for travel costs
for companions of SIGPLAN members with physical disabilities, as well as for
travel from locations outside of North America and Europe. For details on the
PAC programme, see its web page.
Scope
-----
In addition to the traditional PEPM topics (see below), PEPM 2019 welcomes
submissions in new domains, in particular:
* Semantics based and machine-learning based program synthesis and program
optimisation.
* Modelling, analysis, and transformation techniques for distributed and
concurrent protocols and programs, such as session types, linear types, and
contract specifications.
More generally, topics of interest for PEPM 2019 include, but are not limited
to:
* Program and model manipulation techniques such as: supercompilation,
partial evaluation, fusion, on-the-fly program adaptation, active
libraries, program inversion, slicing, symbolic execution, refactoring,
decompilation, and obfuscation.
* Techniques that treat programs/models as data objects including
metaprogramming, generative programming, embedded domain-specific
languages, program synthesis by sketching and inductive programming, staged
computation, and model-driven program generation and transformation.
* Program analysis techniques that are used to drive program/model
manipulation such as: abstract interpretation, termination checking,
binding-time analysis, constraint solving, type systems, automated testing
and test case generation.
* Application of the above techniques including case studies of program
manipulation in real-world (industrial, open-source) projects and software
development processes, descriptions of robust tools capable of effectively
handling realistic applications, benchmarking. Examples of application
domains include legacy program understanding and transformation, DSL
implementations, visual languages and end-user programming, scientific
computing, middleware frameworks and infrastructure needed for distributed
and web-based applications, embedded and resource-limited computation, and
security.
This list of categories is not exhaustive, and we encourage submissions
describing new theories and applications related to semantics-based program
manipulation in general. If you have a question as to whether a potential
submission is within the scope of the workshop, please contact the programme
co-chairs, Manuel Hermenegildo and Atsushi Igarashi (manuel.hermenegildo@imdea.org, igarashi@kuis.kyoto-u.ac.jp).
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
2018-11-16
[Caml-list] HCVS 2019 - First Call For Papers
(We apologize for multiple copies)
Call for papers
6th Workshop on Horn Clauses for Verification and Synthesis (HCVS)
Co-located with ETAPS 2019
April 7, 2019 - Prague, Czech Republic
https://conf.researchr.org/track/etaps-2019/hcvs-2019-papers
Many Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses, and many recent advances in the
Constraint/Logic Programming, Verification, and Automated Deduction
communities have centered around efficiently solving problems
presented as Horn clauses.
This workshop aims to bring together researchers working in the
communities of Constraint/Logic Programming (e.g., ICLP and CP),
Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated
Deduction (e.g., CADE), on the topic of Horn clause based analysis,
verification and synthesis.
Horn clauses have been advocated by these communities at different
times and from different perspectives, and this workshop is organized
to stimulate interaction and a fruitful exchange and integration
of experiences.
This edition follows five previous meetings: HCVS 2018 in Oxford, UK
(w/FLoC), HCVS 2017 in Gothenburg, Sweden (w/CADE), HCVS 2016 in
Eindhoven, The Netherlands (w/ETAPS), HCVS 2015 in San Francisco, CA,
USA (w/CAV), and HCVS 2014 in Vienna, Austria (w/VSL).
Aims and Scope
--------------
Topics of interest include but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:
- Analysis and verification of programs and systems of various kinds
(e.g., imperative, object-oriented, functional, logic, higher-order,
concurrent)
- Program synthesis
- Program testing
- Program transformation
- Constraint solving
- Type systems
- Case studies and tools
- Challenging problems
We solicit regular papers describing theory and implementation of
Horn-clause-based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress, as well as
presentations covering previously published results that are of
interest to the workshop.
CHC-COMP
--------
HCVS 2019 will host the 2nd CHC competition (CHC-COMP), which will
compare state-of-the-art tools for CHC solving for performance and
effectiveness on a set of publicly available benchmarks.
More information can be found at https://chc-comp.github.io/
All participants of CHC-COMP are invited (but not obliged) to submit
a tool description for publishing either online or at the proceedings
through the EasyChair system for HCVS (the HCVS deadlines apply).
Important dates
---------------
- Paper submission: 15 Feb 2019
- Paper notification: 7 Mar 2019
- Camera-ready (for informal pre-proceedings): 15 Mar 2019
- Workshop: 7 Apr 2019
- Final camera-ready (for formal post-proceedings): 12 May 2019
Program Committee
-----------------
- Nikolaj Bjørner (Microsoft Research)
- Adrien Champion (OCamlPro)
- Emanuele De Angelis (University of Chieti-Pescara) - chair
- Giorgio Delzanno (Università degli Studi di Genova)
- Grigory Fedyukovich (Princeton University) - chair
- Fabio Fioravanti (University of Chieti-Pescara)
- John Gallagher (Roskilde University)
- Alberto Griggio (Fondazione Bruno Kessler)
- Arie Gurfinkel (University of Waterloo)
- Matthias Heizmann (University of Freiburg)
- Dejan Jovanović (SRI International)
- Bishoksan Kafle (The University of Melbourne)
- Ekaterina Komendantskaya (Heriot-Watt University)
- Jorge A. Navas (SRI International)
- Nadia Polikarpova (University of California San Diego)
- Philipp Ruemmer (Uppsala University)
- Andrey Rybalchenko (Microsoft Research)
- Valerio Senni (ALES Srl - UTRC)
- Alicia Villanueva (Universitat Politècnica de València)
- He Zhu (Galois, Inc)
Submission
----------
Submission has to be done in one of the following formats:
- Regular papers (up to 12 pages plus bibliography in EPTCS format), which
should present previously unpublished work (completed or in progress),
including descriptions of research, tools, and applications.
- Tool papers (up to 4 pages plus bibliography in EPTCS format), including the
papers written by the CHC-COMP participants, which can outline the theoretical
framework, the architecture, the usage, and experiments of the tool.
- Extended abstracts (up to 3 pages in EPTCS format), which describe work
in progress or aim to initiate discussions.
- Presentation-only papers, i.e., papers already submitted or presented at
a conference or another workshop. Such papers can be submitted in any format,
and will not be included in the workshop post-proceedings.
All submitted papers will be reviewed by the program committee and will be
selected for inclusion in accordance with the referee reports.
Accepted papers will be made available before the workshop on the HCVS website
and will be published in a volume of the Electronic Proceedings in Theoretical
Computer (EPTCS) series after the workshop (provided that enough regular and
tool papers are accepted).
Authors of accepted papers are required to ensure that at least one of them
will be present at the workshop. Papers must be submitted through the
EasyChair system using the web page:
https://easychair.org/conferences/?conf=hcvs2019
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
Call for papers
6th Workshop on Horn Clauses for Verification and Synthesis (HCVS)
Co-located with ETAPS 2019
April 7, 2019 - Prague, Czech Republic
https://conf.researchr.org/track/etaps-2019/hcvs-2019-papers
Many Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses, and many recent advances in the
Constraint/Logic Programming, Verification, and Automated Deduction
communities have centered around efficiently solving problems
presented as Horn clauses.
This workshop aims to bring together researchers working in the
communities of Constraint/Logic Programming (e.g., ICLP and CP),
Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated
Deduction (e.g., CADE), on the topic of Horn clause based analysis,
verification and synthesis.
Horn clauses have been advocated by these communities at different
times and from different perspectives, and this workshop is organized
to stimulate interaction and a fruitful exchange and integration
of experiences.
This edition follows five previous meetings: HCVS 2018 in Oxford, UK
(w/FLoC), HCVS 2017 in Gothenburg, Sweden (w/CADE), HCVS 2016 in
Eindhoven, The Netherlands (w/ETAPS), HCVS 2015 in San Francisco, CA,
USA (w/CAV), and HCVS 2014 in Vienna, Austria (w/VSL).
Aims and Scope
--------------
Topics of interest include but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:
- Analysis and verification of programs and systems of various kinds
(e.g., imperative, object-oriented, functional, logic, higher-order,
concurrent)
- Program synthesis
- Program testing
- Program transformation
- Constraint solving
- Type systems
- Case studies and tools
- Challenging problems
We solicit regular papers describing theory and implementation of
Horn-clause-based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress, as well as
presentations covering previously published results that are of
interest to the workshop.
CHC-COMP
--------
HCVS 2019 will host the 2nd CHC competition (CHC-COMP), which will
compare state-of-the-art tools for CHC solving for performance and
effectiveness on a set of publicly available benchmarks.
More information can be found at https://chc-comp.github.io/
All participants of CHC-COMP are invited (but not obliged) to submit
a tool description for publishing either online or at the proceedings
through the EasyChair system for HCVS (the HCVS deadlines apply).
Important dates
---------------
- Paper submission: 15 Feb 2019
- Paper notification: 7 Mar 2019
- Camera-ready (for informal pre-proceedings): 15 Mar 2019
- Workshop: 7 Apr 2019
- Final camera-ready (for formal post-proceedings): 12 May 2019
Program Committee
-----------------
- Nikolaj Bjørner (Microsoft Research)
- Adrien Champion (OCamlPro)
- Emanuele De Angelis (University of Chieti-Pescara) - chair
- Giorgio Delzanno (Università degli Studi di Genova)
- Grigory Fedyukovich (Princeton University) - chair
- Fabio Fioravanti (University of Chieti-Pescara)
- John Gallagher (Roskilde University)
- Alberto Griggio (Fondazione Bruno Kessler)
- Arie Gurfinkel (University of Waterloo)
- Matthias Heizmann (University of Freiburg)
- Dejan Jovanović (SRI International)
- Bishoksan Kafle (The University of Melbourne)
- Ekaterina Komendantskaya (Heriot-Watt University)
- Jorge A. Navas (SRI International)
- Nadia Polikarpova (University of California San Diego)
- Philipp Ruemmer (Uppsala University)
- Andrey Rybalchenko (Microsoft Research)
- Valerio Senni (ALES Srl - UTRC)
- Alicia Villanueva (Universitat Politècnica de València)
- He Zhu (Galois, Inc)
Submission
----------
Submission has to be done in one of the following formats:
- Regular papers (up to 12 pages plus bibliography in EPTCS format), which
should present previously unpublished work (completed or in progress),
including descriptions of research, tools, and applications.
- Tool papers (up to 4 pages plus bibliography in EPTCS format), including the
papers written by the CHC-COMP participants, which can outline the theoretical
framework, the architecture, the usage, and experiments of the tool.
- Extended abstracts (up to 3 pages in EPTCS format), which describe work
in progress or aim to initiate discussions.
- Presentation-only papers, i.e., papers already submitted or presented at
a conference or another workshop. Such papers can be submitted in any format,
and will not be included in the workshop post-proceedings.
All submitted papers will be reviewed by the program committee and will be
selected for inclusion in accordance with the referee reports.
Accepted papers will be made available before the workshop on the HCVS website
and will be published in a volume of the Electronic Proceedings in Theoretical
Computer (EPTCS) series after the workshop (provided that enough regular and
tool papers are accepted).
Authors of accepted papers are required to ensure that at least one of them
will be present at the workshop. Papers must be submitted through the
EasyChair system using the web page:
https://easychair.org/conferences/?conf=hcvs2019
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
2018-11-09
[Caml-list] First Call for Papers: PACMPL issue ICFP 2019
PACMPL Volume 3, Issue ICFP 2019
Call for Papers
accepted papers to be invited for presentation at
The 24th ACM SIGPLAN International Conference on Functional Programming
Berlin, Germany
http://icfp19.sigplan.org/
### Important dates
Submissions due: 1 March 2019 (Friday) Anywhere on Earth
https://icfp19.hotcrp.com
Author response: 16 April (Tuesday) - 18 Apri (Friday) 14:00 UTC
Notification: 3 May (Friday)
Final copy due: 22 June (Saturday)
Conference: 18 August (Sunday) - 23 August (Friday)
### About PACMPL
Proceedings of the ACM on Programming Languages (PACMPL <https://pacmpl.acm.org/>) is a Gold Open Access journal publishing research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. Each issue of the journal is devoted to a particular subject area within programming languages and will be announced through publicized Calls for Papers, like this one.
### Scope
[PACMPL](https://pacmpl.acm.org/) issue ICFP 2019 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to):
* *Language Design*: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming.
* *Implementation*: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources.
* *Software-Development Techniques*: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling.
* *Foundations*: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types.
* *Analysis and Transformation*: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation.
* *Applications*: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security.
* *Education*: teaching introductory programming; parallel programming; mathematical proof; algebra.
Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience.
PACMPL issue ICFP 2019 also welcomes submissions in two separate categories — Functional Pearls and Experience Reports — that must be marked as such at the time of submission and that need not report original research results. Detailed guidelines on both categories are given at the end of this call.
Please contact the principal editor if you have questions or are concerned about the appropriateness of a topic.
### Preparation of submissions
**Deadline**: The deadline for submissions is **Friday, March 1, 2019**, Anywhere on Earth (<https://en.wikipedia.org/wiki/Anywhere_on_Earth>). This deadline will be strictly enforced.
**Formatting**: Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Small" template that is available (in both LaTeX and Word formats) from <https://www.acm.org/publications/authors/submissions>. For authors using LaTeX, a lighter-weight package, including only the essential files, is available from <http://sigplan.org/Resources/Author/#acmart-format>.
There is a limit of **25 pages for a full paper or Functional Pearl** and **12 pages for an Experience Report**; in either case, the bibliography will not be counted against these limits. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. Supplementary material can and should be **separately** submitted (see below).
See also PACMPL's Information and Guidelines for Authors at <https://pacmpl.acm.org/authors.cfm>.
**Submission**: Submissions will be accepted at <https://icfp19.hotcrp.com/>
Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface.
**Author Response Period**: Authors will have a 72-hour period, starting at 14:00 UTC on **Tuesday, April 16, 2019**, to read reviews and respond to them.
**Supplementary Material**: Authors have the option to attach supplementary
material to a submission, on the understanding that reviewers may choose not
to look at it. This supplementary material should **not** be submitted as part
of the main document; instead, it should be uploaded as a **separate** PDF
document or tarball.
Supplementary material should be uploaded **at submission time**, not by
providing a URL in the paper that points to an external repository.
Authors are free to upload both anonymized and non-anonymized supplementary
material. Anonymized supplementary material will be visible to reviewers
immediately; non-anonymized supplementary material will be revealed to
reviewers only after they have submitted their review of the paper and learned
the identity of the author(s).
**Authorship Policies**: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at <https://www.acm.org/publications/authors/information-for-authors>.
**Republication Policies**: Each submission must adhere to SIGPLAN's republication policy, as explained on the web at <http://www.sigplan.org/Resources/Policies/Republication>.
**Resubmitted Papers**: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the principal editor will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews.
### Review Process
This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for PACMPL issue ICFP 2019. We anticipate that there will be a need to clarify and expand on this process, and we will maintain a list of frequently asked questions and answers on the conference website to address common concerns.
**PACMPL issue ICFP 2019 will employ a two-stage review process.** The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. At the review meeting, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on **May 3, 2019**.
Authors of conditionally accepted papers will be provided with committee reviews (just as in previous conferences) along with a set of mandatory revisions. After four weeks (May 31, 2019), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within four weeks and hence that conditionally accepted papers will in general be accepted in the second phase.
The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper's rejection.
**PACMPL issue ICFP 2019 will employ a lightweight double-blind reviewing process.** To facilitate this, submitted papers must adhere to two rules:
1. **author names and institutions must be omitted**, and
2. **references to authors' own related work should be in the third person** (e.g., not "We build on our previous work ..." but rather "We build on the work of ...").
The purpose of this process is to help the reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.
### Information for Authors of Accepted Papers
* As a condition of acceptance, final versions of all papers must adhere to the new ACM Small format. The page limit for the final versions of papers will be increased by two pages to help authors respond to reviewer comments and mandatory revisions: **27 pages plus bibliography for a regular paper or Functional Pearl, 14 pages plus bibliography for an Experience Report**.
* Authors of accepted submissions will be required to agree to one of the three ACM licensing options: open access on payment of a fee (**recommended**, and SIGPLAN can cover the cost as described next); copyright transfer to ACM; or retaining copyright but granting ACM exclusive publication rights. Further information about ACM author rights is available from <http://authors.acm.org>.
* PACMPL is a Gold Open Access journal. It will be archived in ACM's Digital Library, but no membership or fee is required for access. Gold Open Access has been made possible by generous funding through ACM SIGPLAN, which will cover all open access costs in the event authors cannot. Authors who can cover the costs may do so by paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM Headquarters are committed to exploring routes to making Gold Open Access publication both affordable and sustainable.
* ACM offers authors a range of copyright options, one of which is Creative Commons CC-BY publication; this is the option recommended by the PACMPL editorial board. A reasoned argument in favour of this option can be found in the article [Why CC-BY?](https://oaspa.org/why-cc-by/) published by OASPA, the Open Access Scholarly Publishers Association.
* We intend that the papers will be freely available for download from the ACM Digital Library in perpetuity via the OpenTOC mechanism.
* ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit <http://www.acm.org/publications/acm-author-izer-service> to learn how to create links for free downloads from the ACM DL.
* At least one author of each accepted submissions will be expected to attend and present their paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be videotaped and released online if the presenter consents.
* The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to *two weeks prior* to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.
### Artifact Evaluation
Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by an Artifact Evaluation Committee, separate from the paper Review Committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the papers, for example, by including them as "source materials" in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging.
Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance.
### Special categories of papers
In addition to research papers, PACMPL issue ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines.
#### Functional Pearls
A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to:
* a new and thought-provoking way of looking at an old idea
* an instructive example of program calculation or proof
* a nifty presentation of an old or new data structure
* an interesting application of functional programming techniques
* a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls.
Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing.
A submission that is intended to be treated as a pearl must be marked as such on the submission web page, and should contain the words "Functional Pearl" somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference's acceptance rate.
<a name="experience-reports"></a>
#### Experience Reports
The purpose of an Experience Report is to help create a body of published, refereed, citable evidence that functional programming really works — or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited to:
* insights gained from real-world projects using functional programming
* comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum
* project-management, business, or legal issues encountered when using functional programming in a real-world project
* curricular issues encountered when using functional programming in education
* real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general
An Experience Report is distinguished from a normal PACMPL issue ICFP paper by its title, by its length, and by the criteria used to evaluate it.
* Both in the papers and in any citations, the title of each accepted Experience Report must end with the words "(Experience Report)" in parentheses. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers.
* Experience Report submissions can be at most 12 pages long, excluding bibliography.
* Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience reports may be asked to give shorter talks.
* Because the purpose of Experience Reports is to enable our community to accumulate a body of evidence about the efficacy of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to ICFP, but it need not be novel.
The review committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing evidence is obtained from papers which show how functional programming was used than from papers which only say that functional programming was used. The most convincing evidence often includes comparisons of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people.
An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results — the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming; for example, it is more valuable to say that the team delivered its software a month ahead of schedule than it is to say that functional programming made the team more productive.
If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better to submit it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The principal editor will be happy to advise on any concerns about which category to submit to.
### ICFP Organizers
General Chair: Derek Dreyer (MPI-SWS, Germany)
Artifact Evaluation Co-Chairs: Simon Marlow (Facebook, UK)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Ilya Sergey (Yale-NUS College, Singapore)
Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA)
Student Research Competition Chair: William J. Bowman (University of British Columbia, Canada)
Workshops Co-Chair: Christophe Scholliers (Universiteit Gent, Belgium)
Jennifer Hackett (University of Nottingham, UK)
Conference Manager: Annabel Satin (P.C.K.)
### PACMPL Volume 3, Issue ICFP 2019
Principal Editor: François Pottier (Inria, France)
Review Committee:
Lennart Beringer (Princeton University, United States)
Joachim Breitner (DFINITY Foundation, Germany)
Laura M. Castro (University of A Coruña, Spain)
Ezgi Çiçek (Facebook London, United Kingdom)
Pierre-Evariste Dagand (LIP6/CNRS, France)
Christos Dimoulas (Northwestern University, United States)
Jacques-Henri Jourdan (CNRS, LRI, Université Paris-Sud, France)
Andrew Kennedy (Facebook London, United Kingdom)
Daan Leijen (Microsoft Research, United States)
Kazutaka Matsuda (Tohoku University, Japan)
Bruno C. d. S. Oliveira (University of Hong Kong, China)
Klaus Ostermann (University of Tübingen, Germany)
Jennifer Paykin (Galois, United States)
Frank Pfenning (Carnegie Mellon University, USA)
Mike Rainey (Indiana University, USA)
Chung-chieh Shan (Indiana University, USA)
Sam Staton (University of Oxford, UK)
Pierre-Yves Strub (Ecole Polytechnique, France)
German Vidal (Universitat Politecnica de Valencia, Spain)
External Review Committee:
Michael D. Adams (University of Utah, USA)
Robert Atkey (University of Strathclyde, IK)
Sheng Chen (University of Louisiana at Lafayette, USA)
James Cheney (University of Edinburgh, UK)
Adam Chlipala (Massachusetts Institute of Technology, USA)
Evelyne Contejean (LRI, Université Paris-Sud, France)
Germán Andrés Delbianco (IRIF, Université Paris Diderot, France)
Dominique Devriese (Vrije Universiteit Brussel, Belgium)
Richard A. Eisenberg (Bryn Mawr College, USA)
Conal Elliott (Target, USA)
Sebastian Erdweg (Delft University of Technology, Netherlands)
Michael Greenberg (Pomona College, USA)
Adrien Guatto (IRIF, Université Paris Diderot, France)
Jennifer Hackett (University of Nottingham, UK)
Troels Henriksen (University of Copenhagen, Denmark)
Chung-Kil Hur (Seoul National University, Republic of Korea)
Roberto Ierusalimschy (PUC-Rio, Brazil)
Ranjit Jhala (University of California, San Diego, USA)
Ralf Jung (MPI-SWS, Germany)
Ohad Kammar (University of Oxford, UK)
Oleg Kiselyov (Tohoku University, Japan)
Hsiang-Shang 'Josh' Ko (National Institute of Informatics, Japan)
Ondřej Lhoták (University of Waterloo, Canada)
Dan Licata (Wesleyan University, USA)
Geoffrey Mainland (Drexel University, USA)
Simon Marlow (Facebook, UK)
Akimasa Morihata (University of Tokyo, Japan)
Shin-Cheng Mu (Academia Sinica, Taiwan)
Guillaume Munch-Maccagnoni (Inria, France)
Kim Nguyễn (University of Paris-Sud, France)
Ulf Norell (Gothenburg University, Sweden)
Atsushi Ohori (Tohoku University, Japan)
Rex Page (University of Oklahoma, USA)
Zoe Paraskevopoulou (Princeton University, USA)
Nadia Polikarpova (University of California, San Diego, USA)
Jonathan Protzenko (Microsoft Research, USA)
Tiark Rompf (Purdue University, USA)
Andreas Rossberg (Dfinity, Germany)
KC Sivaramakrishnan (University of Cambridge, UI)
Nicholas Smallbone (Chalmers University of Technology, Sweden)
Matthieu Sozeau (Inria, France)
Sandro Stucki (Chalmers | University of Gothenburg, Sweden)
Don Syme (Microsoft, UK)
Zachary Tatlock (University of Washington, USA)
Sam Tobin-Hochstadt (Indiana University, USA)
Takeshi Tsukada (University of Tokyo, Japan)
Tarmo Uustalu (Reykjavik University, Iceland)
Benoit Valiron (LRI, CentraleSupelec, Univ. Paris Saclay, France)
Daniel Winograd-Cort (University of Pennsylvania, USA)
Nicolas Wu (University of Bristol, UK)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
Call for Papers
accepted papers to be invited for presentation at
The 24th ACM SIGPLAN International Conference on Functional Programming
Berlin, Germany
http://icfp19.sigplan.org/
### Important dates
Submissions due: 1 March 2019 (Friday) Anywhere on Earth
https://icfp19.hotcrp.com
Author response: 16 April (Tuesday) - 18 Apri (Friday) 14:00 UTC
Notification: 3 May (Friday)
Final copy due: 22 June (Saturday)
Conference: 18 August (Sunday) - 23 August (Friday)
### About PACMPL
Proceedings of the ACM on Programming Languages (PACMPL <https://pacmpl.acm.org/>) is a Gold Open Access journal publishing research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. Each issue of the journal is devoted to a particular subject area within programming languages and will be announced through publicized Calls for Papers, like this one.
### Scope
[PACMPL](https://pacmpl.acm.org/) issue ICFP 2019 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to):
* *Language Design*: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming.
* *Implementation*: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources.
* *Software-Development Techniques*: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling.
* *Foundations*: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types.
* *Analysis and Transformation*: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation.
* *Applications*: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security.
* *Education*: teaching introductory programming; parallel programming; mathematical proof; algebra.
Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience.
PACMPL issue ICFP 2019 also welcomes submissions in two separate categories — Functional Pearls and Experience Reports — that must be marked as such at the time of submission and that need not report original research results. Detailed guidelines on both categories are given at the end of this call.
Please contact the principal editor if you have questions or are concerned about the appropriateness of a topic.
### Preparation of submissions
**Deadline**: The deadline for submissions is **Friday, March 1, 2019**, Anywhere on Earth (<https://en.wikipedia.org/wiki/Anywhere_on_Earth>). This deadline will be strictly enforced.
**Formatting**: Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Small" template that is available (in both LaTeX and Word formats) from <https://www.acm.org/publications/authors/submissions>. For authors using LaTeX, a lighter-weight package, including only the essential files, is available from <http://sigplan.org/Resources/Author/#acmart-format>.
There is a limit of **25 pages for a full paper or Functional Pearl** and **12 pages for an Experience Report**; in either case, the bibliography will not be counted against these limits. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. Supplementary material can and should be **separately** submitted (see below).
See also PACMPL's Information and Guidelines for Authors at <https://pacmpl.acm.org/authors.cfm>.
**Submission**: Submissions will be accepted at <https://icfp19.hotcrp.com/>
Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface.
**Author Response Period**: Authors will have a 72-hour period, starting at 14:00 UTC on **Tuesday, April 16, 2019**, to read reviews and respond to them.
**Supplementary Material**: Authors have the option to attach supplementary
material to a submission, on the understanding that reviewers may choose not
to look at it. This supplementary material should **not** be submitted as part
of the main document; instead, it should be uploaded as a **separate** PDF
document or tarball.
Supplementary material should be uploaded **at submission time**, not by
providing a URL in the paper that points to an external repository.
Authors are free to upload both anonymized and non-anonymized supplementary
material. Anonymized supplementary material will be visible to reviewers
immediately; non-anonymized supplementary material will be revealed to
reviewers only after they have submitted their review of the paper and learned
the identity of the author(s).
**Authorship Policies**: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at <https://www.acm.org/publications/authors/information-for-authors>.
**Republication Policies**: Each submission must adhere to SIGPLAN's republication policy, as explained on the web at <http://www.sigplan.org/Resources/Policies/Republication>.
**Resubmitted Papers**: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the principal editor will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews.
### Review Process
This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for PACMPL issue ICFP 2019. We anticipate that there will be a need to clarify and expand on this process, and we will maintain a list of frequently asked questions and answers on the conference website to address common concerns.
**PACMPL issue ICFP 2019 will employ a two-stage review process.** The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. At the review meeting, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on **May 3, 2019**.
Authors of conditionally accepted papers will be provided with committee reviews (just as in previous conferences) along with a set of mandatory revisions. After four weeks (May 31, 2019), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within four weeks and hence that conditionally accepted papers will in general be accepted in the second phase.
The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper's rejection.
**PACMPL issue ICFP 2019 will employ a lightweight double-blind reviewing process.** To facilitate this, submitted papers must adhere to two rules:
1. **author names and institutions must be omitted**, and
2. **references to authors' own related work should be in the third person** (e.g., not "We build on our previous work ..." but rather "We build on the work of ...").
The purpose of this process is to help the reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.
### Information for Authors of Accepted Papers
* As a condition of acceptance, final versions of all papers must adhere to the new ACM Small format. The page limit for the final versions of papers will be increased by two pages to help authors respond to reviewer comments and mandatory revisions: **27 pages plus bibliography for a regular paper or Functional Pearl, 14 pages plus bibliography for an Experience Report**.
* Authors of accepted submissions will be required to agree to one of the three ACM licensing options: open access on payment of a fee (**recommended**, and SIGPLAN can cover the cost as described next); copyright transfer to ACM; or retaining copyright but granting ACM exclusive publication rights. Further information about ACM author rights is available from <http://authors.acm.org>.
* PACMPL is a Gold Open Access journal. It will be archived in ACM's Digital Library, but no membership or fee is required for access. Gold Open Access has been made possible by generous funding through ACM SIGPLAN, which will cover all open access costs in the event authors cannot. Authors who can cover the costs may do so by paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM Headquarters are committed to exploring routes to making Gold Open Access publication both affordable and sustainable.
* ACM offers authors a range of copyright options, one of which is Creative Commons CC-BY publication; this is the option recommended by the PACMPL editorial board. A reasoned argument in favour of this option can be found in the article [Why CC-BY?](https://oaspa.org/why-cc-by/) published by OASPA, the Open Access Scholarly Publishers Association.
* We intend that the papers will be freely available for download from the ACM Digital Library in perpetuity via the OpenTOC mechanism.
* ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit <http://www.acm.org/publications/acm-author-izer-service> to learn how to create links for free downloads from the ACM DL.
* At least one author of each accepted submissions will be expected to attend and present their paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be videotaped and released online if the presenter consents.
* The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to *two weeks prior* to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.
### Artifact Evaluation
Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by an Artifact Evaluation Committee, separate from the paper Review Committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the papers, for example, by including them as "source materials" in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging.
Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance.
### Special categories of papers
In addition to research papers, PACMPL issue ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines.
#### Functional Pearls
A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to:
* a new and thought-provoking way of looking at an old idea
* an instructive example of program calculation or proof
* a nifty presentation of an old or new data structure
* an interesting application of functional programming techniques
* a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls.
Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing.
A submission that is intended to be treated as a pearl must be marked as such on the submission web page, and should contain the words "Functional Pearl" somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference's acceptance rate.
<a name="experience-reports"></a>
#### Experience Reports
The purpose of an Experience Report is to help create a body of published, refereed, citable evidence that functional programming really works — or to describe what obstacles prevent it from working.
Possible topics for an Experience Report include, but are not limited to:
* insights gained from real-world projects using functional programming
* comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum
* project-management, business, or legal issues encountered when using functional programming in a real-world project
* curricular issues encountered when using functional programming in education
* real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general
An Experience Report is distinguished from a normal PACMPL issue ICFP paper by its title, by its length, and by the criteria used to evaluate it.
* Both in the papers and in any citations, the title of each accepted Experience Report must end with the words "(Experience Report)" in parentheses. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers.
* Experience Report submissions can be at most 12 pages long, excluding bibliography.
* Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience reports may be asked to give shorter talks.
* Because the purpose of Experience Reports is to enable our community to accumulate a body of evidence about the efficacy of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to ICFP, but it need not be novel.
The review committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing evidence is obtained from papers which show how functional programming was used than from papers which only say that functional programming was used. The most convincing evidence often includes comparisons of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people.
An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results — the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming; for example, it is more valuable to say that the team delivered its software a month ahead of schedule than it is to say that functional programming made the team more productive.
If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better to submit it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The principal editor will be happy to advise on any concerns about which category to submit to.
### ICFP Organizers
General Chair: Derek Dreyer (MPI-SWS, Germany)
Artifact Evaluation Co-Chairs: Simon Marlow (Facebook, UK)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Ilya Sergey (Yale-NUS College, Singapore)
Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA)
Student Research Competition Chair: William J. Bowman (University of British Columbia, Canada)
Workshops Co-Chair: Christophe Scholliers (Universiteit Gent, Belgium)
Jennifer Hackett (University of Nottingham, UK)
Conference Manager: Annabel Satin (P.C.K.)
### PACMPL Volume 3, Issue ICFP 2019
Principal Editor: François Pottier (Inria, France)
Review Committee:
Lennart Beringer (Princeton University, United States)
Joachim Breitner (DFINITY Foundation, Germany)
Laura M. Castro (University of A Coruña, Spain)
Ezgi Çiçek (Facebook London, United Kingdom)
Pierre-Evariste Dagand (LIP6/CNRS, France)
Christos Dimoulas (Northwestern University, United States)
Jacques-Henri Jourdan (CNRS, LRI, Université Paris-Sud, France)
Andrew Kennedy (Facebook London, United Kingdom)
Daan Leijen (Microsoft Research, United States)
Kazutaka Matsuda (Tohoku University, Japan)
Bruno C. d. S. Oliveira (University of Hong Kong, China)
Klaus Ostermann (University of Tübingen, Germany)
Jennifer Paykin (Galois, United States)
Frank Pfenning (Carnegie Mellon University, USA)
Mike Rainey (Indiana University, USA)
Chung-chieh Shan (Indiana University, USA)
Sam Staton (University of Oxford, UK)
Pierre-Yves Strub (Ecole Polytechnique, France)
German Vidal (Universitat Politecnica de Valencia, Spain)
External Review Committee:
Michael D. Adams (University of Utah, USA)
Robert Atkey (University of Strathclyde, IK)
Sheng Chen (University of Louisiana at Lafayette, USA)
James Cheney (University of Edinburgh, UK)
Adam Chlipala (Massachusetts Institute of Technology, USA)
Evelyne Contejean (LRI, Université Paris-Sud, France)
Germán Andrés Delbianco (IRIF, Université Paris Diderot, France)
Dominique Devriese (Vrije Universiteit Brussel, Belgium)
Richard A. Eisenberg (Bryn Mawr College, USA)
Conal Elliott (Target, USA)
Sebastian Erdweg (Delft University of Technology, Netherlands)
Michael Greenberg (Pomona College, USA)
Adrien Guatto (IRIF, Université Paris Diderot, France)
Jennifer Hackett (University of Nottingham, UK)
Troels Henriksen (University of Copenhagen, Denmark)
Chung-Kil Hur (Seoul National University, Republic of Korea)
Roberto Ierusalimschy (PUC-Rio, Brazil)
Ranjit Jhala (University of California, San Diego, USA)
Ralf Jung (MPI-SWS, Germany)
Ohad Kammar (University of Oxford, UK)
Oleg Kiselyov (Tohoku University, Japan)
Hsiang-Shang 'Josh' Ko (National Institute of Informatics, Japan)
Ondřej Lhoták (University of Waterloo, Canada)
Dan Licata (Wesleyan University, USA)
Geoffrey Mainland (Drexel University, USA)
Simon Marlow (Facebook, UK)
Akimasa Morihata (University of Tokyo, Japan)
Shin-Cheng Mu (Academia Sinica, Taiwan)
Guillaume Munch-Maccagnoni (Inria, France)
Kim Nguyễn (University of Paris-Sud, France)
Ulf Norell (Gothenburg University, Sweden)
Atsushi Ohori (Tohoku University, Japan)
Rex Page (University of Oklahoma, USA)
Zoe Paraskevopoulou (Princeton University, USA)
Nadia Polikarpova (University of California, San Diego, USA)
Jonathan Protzenko (Microsoft Research, USA)
Tiark Rompf (Purdue University, USA)
Andreas Rossberg (Dfinity, Germany)
KC Sivaramakrishnan (University of Cambridge, UI)
Nicholas Smallbone (Chalmers University of Technology, Sweden)
Matthieu Sozeau (Inria, France)
Sandro Stucki (Chalmers | University of Gothenburg, Sweden)
Don Syme (Microsoft, UK)
Zachary Tatlock (University of Washington, USA)
Sam Tobin-Hochstadt (Indiana University, USA)
Takeshi Tsukada (University of Tokyo, Japan)
Tarmo Uustalu (Reykjavik University, Iceland)
Benoit Valiron (LRI, CentraleSupelec, Univ. Paris Saclay, France)
Daniel Winograd-Cort (University of Pennsylvania, USA)
Nicolas Wu (University of Bristol, UK)
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list https://inbox.ocaml.org/caml-list
Forum: https://discuss.ocaml.org/
Bug reports: http://caml.inria.fr/bin/caml-bugs
2018-11-05
[Caml-list] CONCUR 2019 Call for Papers
=============================
CONCUR 2019 - Call for Papers
=============================
https://event.cwi.nl/concur2019/ The 30th International Conference on Concurrency Theory Amsterdam, The Netherlands, 27-30 August 2019 The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. Invited speakers Marta Kwiatkowska - University of Oxford (UK) Kim G. Larsen - Aalborg University (Denmark) Joel Ouaknine - Max Planck Institute for Software Systems (Germany) Jaco van de Pol - Aarhus University (Denmark) Co-located conference 17th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2019) Co-located workshops Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics (EXPRESS/SOS 2019) 8th IFIP WG 1.8 Workshop on Trends in Concurrency Theory (TRENDS 2019) 4th International workshop on TIming Performance engineering for Safety critical systems (TIPS 2019) 9th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2019) IMPORTANT DATES All dates are AoE. Abstract submission: April 15, 2019 Paper submission: April 22, 2019 Notification: June 14, 2019 Camera ready copy: July 3, 2019 Conference: August 27-30, 2019 TOPICS Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems; Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis; Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols; Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented. PAPER SUBMISSION CONCUR 2019 solicits high quality papers reporting research results and/or experience related to the topics mentioned below. All papers must be original, unpublished, and not submitted for publication elsewhere. Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The CONCUR 2019 proceedings will be published by LIPIcs. Papers must be submitted electronically as PDF files via EasyChair. Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style. ORGANIZATION COMMITTEE General Chair Jos Baeten (CWI, Amsterdam, The Netherlands) Program Co-chairs Wan Fokkink (Vrije Universiteit Amsterdam, The Netherlands) Rob van Glabbeek (Data61, CSIRO, Sydney, Australia) Workshop Chair Bas Luttik (Eindhoven University of Technology, The Netherlands) SPECIAL ISSUE A special issue dedicated to selected papers from CONCUR'2019 will appear in Logical Methods in Computer Science.
2018-10-19
[Caml-list] CADE-27: Call for Papers, Workshops, Tutorials and System Competitions
The 27th International Conference on Automated Deduction (CADE-27)
Natal, Brazil
25-30 August 2019
http://www.cade-27.info
CALL FOR PAPERS
CADE is the major international forum for presenting research on all
aspects of automated deduction. High-quality submissions on the general
topic of automated deduction, including foundations, applications,
implementations, theoretical results, practical experiences and user
studies are solicited.
Key dates:
Abstract deadline: 15 February 2019
Submission deadline: 22 February 2019
* Logics of interest include propositional, first-order, equational,
higher-order, classical, description, modal, temporal, many-valued,
constructive, other non-classical, meta-logics, logical frameworks, type
theory, set theory, as well as any combination thereof.
* Paradigms of interest include theorem proving, model building,
constraint solving, computer algebra, model checking, proof checking,
and their integration.
* Methods of interest include resolution, superposition, completion,
saturation, term rewriting, decision procedures, model elimination,
connection methods, tableaux, sequent calculi, natural deduction, as
well as their supporting algorithms and data structures, including
matching, unification, orderings, induction, indexing techniques, proof
presentation and explanation, proof planning.
* Applications of interest include program analysis, verification and
synthesis of software and hardware, formal methods, computational logic,
computer mathematics, natural language processing, computational
linguistics, knowledge representation, ontology reasoning, deductive
databases, declarative programming, robotics, planning, and other areas
of artificial intelligence.
Submissions can be made in two categories: regular papers and system
descriptions. The page limit in Springer LNCS style is 15 pages
excluding references for regular papers and 10 pages excluding
references for system descriptions. Submissions must be unpublished and
not submitted for publication elsewhere. They will be judged on
relevance, originality, significance, correctness, and readability.
System descriptions must contain a link to a working system and will
also be judged on usefulness and design. Proofs of theoretical results
that do not fit in the page limit, executables of systems, and input
data of experiments should be made available, via a reference to a
website or in an appendix of the paper. For papers containing
experimental evaluations, all data needed to rerun the experiments must
be available. Reviewers will be encouraged to consider this additional
material, but submissions must be self-contained within the respective
page limit; considering the additional material should not be necessary
to assess the merits of a submission. The review process will include a
feedback/rebuttal period where authors will have the option to respond
to reviewer comments. The PC chair may solicit further reviews after the
rebuttal period.
The proceedings of the conference will be published in the Springer
LNCS/LNAI series. Formatting instructions and the LNCS style files can
be obtained at
http://www.springer.de/comp/lncs/authors.html
At every CADE conference the Program Committee selects one of the
accepted papers to receive the CADE Best Paper Award. The award
recognizes a paper that the Program Committee collegially evaluates as
the best in terms of originality and significance, having substantial
confidence in its correctness. Overall technical quality, completeness,
scholarly accuracy, and readability are also considered. Characteristics
associated with a best paper include, for instance, introduction of a
strong new technique or approach, solution of a long-standing open
problem, introduction and solution of an interesting and important new
problem, highly innovative application of known ideas or existing
techniques, and presentation of a new system of outstanding power. Under
exceptional circumstances, the Program Committee may give two awards (ex
aequo) or give no award.
IMPORTANT DATES
Abstract deadline: 15 February 2019
Submission deadline: 22 February 2019
Rebuttal phase: 2 April 2019
Notification: 15 April 2019
Final version: 27 May 2019
SUBMISSION INSTRUCTIONS
Papers should be submitted via
https://easychair.org/conferences/?conf=cade27
CADE-27 ORGANIZERS
Conference Chair:
Elaine Pimentel Federal University of Rio Grande do Norte, Brazil
Organizers:
Carlos Olarte Federal University of Rio Grande do Norte, Brazil
Joao Marcos Federal University of Rio Grande do Norte, Brazil
Claudia Nalon University of Brasilia, Brazil
Giselle Reis CMU, Qatar
Program Committee Chair:
Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France
Workshop, Tutorial, and Competition Chair:
Giles Reger University of Manchester, UK
Publicity Chair:
Geoff Sutcliffe University of Miami, USA
Program Committee:
Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina
Franz Baader, TU Dresden, Germany
Clark Barrett, Stanford University, USA
Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands
Maria Paola Bonacina, Universita degli Studi di Verona, Italy
Leonardo Mendonca de Moura, Microsoft Research, USA
Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan
Clare Dixon, University of Liverpool, UK
Mnacho Echenim, Universite de Grenoble, France
Marcelo Finger, University of Sao Paulo, Brazil
Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France
Silvio Ghilardi, Universita degli Studi di Milano, Italy
Juergen Giesl, RWTH Aachen University, Germany
Rajeev Gore, The Australian National University, Australia
Stefan Hetzl, Technische Universitaet Wien, Austria
Marijn J. H. Heule, The University of Texas at Austin, USA
Nao Hirokawa, JAIST, Japan
Moa Johansson, Chalmers University of Technology, Sweden
Cezary Kaliszyk, University of Innsbruck, Austria
Deepak Kapur, University of New Mexico, USA
Benjamin Kiesl, Technische Universitaet Wien, Austria
Konstantin Korovin, The University of Manchester, UK
Laura Kovacs, Technische Universitaet Wien, Austria
Ramana Kumar, DeepMind, UK
Claudia Nalon, University of Brasilia, Brazil
Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany
Carlos Olarte, Federal University of Rio Grande do Norte, Brazil
Jens Otten, University of Oslo, Norway
Andre Platzer, Carnegie Mellon University, USA
Andrew Reynolds, The University of Iowa, USA
Philipp Ruemmer, Uppsala University, Sweden
Renate A. Schmidt, The University of Manchester, UK
Stephan Schulz, DHBW Stuttgart, Germany
Roberto Sebastiani, University of Trento, Italy
Natarajan Shankar, SRI International, USA
Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany
Martin Suda, Czech Technical University, Czech Republic
Geoff Sutcliffe, University of Miami, USA
Rene Thiemann, University of Innsbruck, Austria
Uwe Waldmann, Max Planck Institute for Informatics, Germany
Christoph Weidenbach, Max Planck Institute for Informatics, Germany
Sarah Winkler, University of Innsbruck, Austria
CALL FOR WORKSHOPS, TUTORIALS, SYSTEM COMPETITIONS
The 27th International Conference on Automated Deduction (CADE-27)
Natal, Brazil
25-30 August 2019
http://www.cade-27.info
CALL FOR WORKSHOPS
Workshop proposals for CADE-27 are solicited. The workshops will take
place on August 25-26 2019, before the main conference. Both
well-established workshops and newer ones are encouraged. Similarly,
proposals for workshops with a tight focus on a core automated reasoning
specialization, as well as those with a broader, more applied focus, are
very welcome.
Please provide the following information in your application document:
+ Workshop title.
+ Names and affiliations of organizers.
+ Proposed workshop duration (from half a day to two days) and preferred day(s).
+ Brief description of the goals and the scope of the workshop. Why is
the workshop relevant for CADE?
+ Is the workshop new or has it met previously? In the latter case
information on previous meetings should be given (e.g., links to the
program, number of submissions, number of participants).
+ What are the plans for publication?
CALL FOR TUTORIALS
Tutorial proposals for CADE-27 are solicited. Tutorials are expected to
be either half-day or full-day events, with a theoretical or applied
focus, on a topic of interest for CADE-27. Proposals should provide the
following information:
+ Tutorial title.
+ Names and affiliations of organizers.
+ Proposed tutorial duration (from half a day to one days) and the
preferred day.
+ Brief description of the tutorial's goals and topics to be covered.
+ Whether or not a version of the tutorial has been given previously.
CADE will take care of printing and distributing notes for tutorials
that would like this service.
CALL FOR SYSTEM COMPETITIONS
The CADE ATP System Competition (CASC), which evaluates automated
theorem proving systems for classical logics, has become an integral
part of the CADE conferences.
Further system competition proposals are solicited. The goal is to
foster the development of automated reasoning systems in all areas
relevant for automated deduction in a broader sense. Proposals should
include the following information:
+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Room/space requirements.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before? In the latter
case information on previous competitions should be given.
+ What computing resources are required and how will they be provided?
IMPORTANT DATES
Workshop/Tutorials/System Competitions:
Submission deadline: 15 November 2018
Notification: 15 December 2018
SUBMISSION INSTRUCTIONS
Proposals for workshops, tutorials, and system competitions should be
uploaded via
https://easychair.org/conferences/?conf=cade27wtc
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
Natal, Brazil
25-30 August 2019
http://www.cade-27.info
CALL FOR PAPERS
CADE is the major international forum for presenting research on all
aspects of automated deduction. High-quality submissions on the general
topic of automated deduction, including foundations, applications,
implementations, theoretical results, practical experiences and user
studies are solicited.
Key dates:
Abstract deadline: 15 February 2019
Submission deadline: 22 February 2019
* Logics of interest include propositional, first-order, equational,
higher-order, classical, description, modal, temporal, many-valued,
constructive, other non-classical, meta-logics, logical frameworks, type
theory, set theory, as well as any combination thereof.
* Paradigms of interest include theorem proving, model building,
constraint solving, computer algebra, model checking, proof checking,
and their integration.
* Methods of interest include resolution, superposition, completion,
saturation, term rewriting, decision procedures, model elimination,
connection methods, tableaux, sequent calculi, natural deduction, as
well as their supporting algorithms and data structures, including
matching, unification, orderings, induction, indexing techniques, proof
presentation and explanation, proof planning.
* Applications of interest include program analysis, verification and
synthesis of software and hardware, formal methods, computational logic,
computer mathematics, natural language processing, computational
linguistics, knowledge representation, ontology reasoning, deductive
databases, declarative programming, robotics, planning, and other areas
of artificial intelligence.
Submissions can be made in two categories: regular papers and system
descriptions. The page limit in Springer LNCS style is 15 pages
excluding references for regular papers and 10 pages excluding
references for system descriptions. Submissions must be unpublished and
not submitted for publication elsewhere. They will be judged on
relevance, originality, significance, correctness, and readability.
System descriptions must contain a link to a working system and will
also be judged on usefulness and design. Proofs of theoretical results
that do not fit in the page limit, executables of systems, and input
data of experiments should be made available, via a reference to a
website or in an appendix of the paper. For papers containing
experimental evaluations, all data needed to rerun the experiments must
be available. Reviewers will be encouraged to consider this additional
material, but submissions must be self-contained within the respective
page limit; considering the additional material should not be necessary
to assess the merits of a submission. The review process will include a
feedback/rebuttal period where authors will have the option to respond
to reviewer comments. The PC chair may solicit further reviews after the
rebuttal period.
The proceedings of the conference will be published in the Springer
LNCS/LNAI series. Formatting instructions and the LNCS style files can
be obtained at
http://www.springer.de/comp/lncs/authors.html
At every CADE conference the Program Committee selects one of the
accepted papers to receive the CADE Best Paper Award. The award
recognizes a paper that the Program Committee collegially evaluates as
the best in terms of originality and significance, having substantial
confidence in its correctness. Overall technical quality, completeness,
scholarly accuracy, and readability are also considered. Characteristics
associated with a best paper include, for instance, introduction of a
strong new technique or approach, solution of a long-standing open
problem, introduction and solution of an interesting and important new
problem, highly innovative application of known ideas or existing
techniques, and presentation of a new system of outstanding power. Under
exceptional circumstances, the Program Committee may give two awards (ex
aequo) or give no award.
IMPORTANT DATES
Abstract deadline: 15 February 2019
Submission deadline: 22 February 2019
Rebuttal phase: 2 April 2019
Notification: 15 April 2019
Final version: 27 May 2019
SUBMISSION INSTRUCTIONS
Papers should be submitted via
https://easychair.org/conferences/?conf=cade27
CADE-27 ORGANIZERS
Conference Chair:
Elaine Pimentel Federal University of Rio Grande do Norte, Brazil
Organizers:
Carlos Olarte Federal University of Rio Grande do Norte, Brazil
Joao Marcos Federal University of Rio Grande do Norte, Brazil
Claudia Nalon University of Brasilia, Brazil
Giselle Reis CMU, Qatar
Program Committee Chair:
Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France
Workshop, Tutorial, and Competition Chair:
Giles Reger University of Manchester, UK
Publicity Chair:
Geoff Sutcliffe University of Miami, USA
Program Committee:
Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina
Franz Baader, TU Dresden, Germany
Clark Barrett, Stanford University, USA
Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands
Maria Paola Bonacina, Universita degli Studi di Verona, Italy
Leonardo Mendonca de Moura, Microsoft Research, USA
Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan
Clare Dixon, University of Liverpool, UK
Mnacho Echenim, Universite de Grenoble, France
Marcelo Finger, University of Sao Paulo, Brazil
Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France
Silvio Ghilardi, Universita degli Studi di Milano, Italy
Juergen Giesl, RWTH Aachen University, Germany
Rajeev Gore, The Australian National University, Australia
Stefan Hetzl, Technische Universitaet Wien, Austria
Marijn J. H. Heule, The University of Texas at Austin, USA
Nao Hirokawa, JAIST, Japan
Moa Johansson, Chalmers University of Technology, Sweden
Cezary Kaliszyk, University of Innsbruck, Austria
Deepak Kapur, University of New Mexico, USA
Benjamin Kiesl, Technische Universitaet Wien, Austria
Konstantin Korovin, The University of Manchester, UK
Laura Kovacs, Technische Universitaet Wien, Austria
Ramana Kumar, DeepMind, UK
Claudia Nalon, University of Brasilia, Brazil
Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany
Carlos Olarte, Federal University of Rio Grande do Norte, Brazil
Jens Otten, University of Oslo, Norway
Andre Platzer, Carnegie Mellon University, USA
Andrew Reynolds, The University of Iowa, USA
Philipp Ruemmer, Uppsala University, Sweden
Renate A. Schmidt, The University of Manchester, UK
Stephan Schulz, DHBW Stuttgart, Germany
Roberto Sebastiani, University of Trento, Italy
Natarajan Shankar, SRI International, USA
Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany
Martin Suda, Czech Technical University, Czech Republic
Geoff Sutcliffe, University of Miami, USA
Rene Thiemann, University of Innsbruck, Austria
Uwe Waldmann, Max Planck Institute for Informatics, Germany
Christoph Weidenbach, Max Planck Institute for Informatics, Germany
Sarah Winkler, University of Innsbruck, Austria
CALL FOR WORKSHOPS, TUTORIALS, SYSTEM COMPETITIONS
The 27th International Conference on Automated Deduction (CADE-27)
Natal, Brazil
25-30 August 2019
http://www.cade-27.info
CALL FOR WORKSHOPS
Workshop proposals for CADE-27 are solicited. The workshops will take
place on August 25-26 2019, before the main conference. Both
well-established workshops and newer ones are encouraged. Similarly,
proposals for workshops with a tight focus on a core automated reasoning
specialization, as well as those with a broader, more applied focus, are
very welcome.
Please provide the following information in your application document:
+ Workshop title.
+ Names and affiliations of organizers.
+ Proposed workshop duration (from half a day to two days) and preferred day(s).
+ Brief description of the goals and the scope of the workshop. Why is
the workshop relevant for CADE?
+ Is the workshop new or has it met previously? In the latter case
information on previous meetings should be given (e.g., links to the
program, number of submissions, number of participants).
+ What are the plans for publication?
CALL FOR TUTORIALS
Tutorial proposals for CADE-27 are solicited. Tutorials are expected to
be either half-day or full-day events, with a theoretical or applied
focus, on a topic of interest for CADE-27. Proposals should provide the
following information:
+ Tutorial title.
+ Names and affiliations of organizers.
+ Proposed tutorial duration (from half a day to one days) and the
preferred day.
+ Brief description of the tutorial's goals and topics to be covered.
+ Whether or not a version of the tutorial has been given previously.
CADE will take care of printing and distributing notes for tutorials
that would like this service.
CALL FOR SYSTEM COMPETITIONS
The CADE ATP System Competition (CASC), which evaluates automated
theorem proving systems for classical logics, has become an integral
part of the CADE conferences.
Further system competition proposals are solicited. The goal is to
foster the development of automated reasoning systems in all areas
relevant for automated deduction in a broader sense. Proposals should
include the following information:
+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Room/space requirements.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before? In the latter
case information on previous competitions should be given.
+ What computing resources are required and how will they be provided?
IMPORTANT DATES
Workshop/Tutorials/System Competitions:
Submission deadline: 15 November 2018
Notification: 15 December 2018
SUBMISSION INSTRUCTIONS
Proposals for workshops, tutorials, and system competitions should be
uploaded via
https://easychair.org/conferences/?conf=cade27wtc
--
Caml-list mailing list. Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
Subscribe to:
Posts (Atom)