categories - Category Theory list
 help / color / mirror / Atom feed
* ICFP 2022: Call for Tutorials, Panels, and Discussions
@ 2022-06-07  8:34 ICFP Publicity
  0 siblings, 0 replies; only message in thread
From: ICFP Publicity @ 2022-06-07  8:34 UTC (permalink / raw)
  To: agda, agents, appsem, bigloo, caml-list, categories,
	chicken-scheme, coq-club, ecoop, erlang-questions,
	F# Discussions, fp-nl, fun, gambit-list, GPCE-related, haskell,
	haskell-cafe, infodir_sigplan, isabelle-users, k-users, mlton,
	nvti, prog-lang, racket-users, relics

        CALL FOR TUTORIAL, PANEL, AND DISCUSSION PROPOSALS

                            ICFP 2022

 27th ACM SIGPLAN International Conference on Functional Programming



                    Sun 11 - Fri 16 September 2022

                         Ljubljana, Slovenia

                     https://icfp22.sigplan.org/



The 27th ACM SIGPLAN International Conference on Functional Programming
will be held on September 11-16, 2022 in Ljubljana, Slovenia.
ICFP provides a forum for researchers and developers to hear about the
latest work on the design, implementations, principles, and uses of
functional programming.


Proposals are invited for tutorials, lasting approximately 3 hours each,
to be presented during ICFP and its co-located workshops and other events.
The tutorials may target an audience who is interested in commercial uses
of functional programming, but we also welcome tutorials whose primary
audience is researchers rather than practitioners. Tutorials may focus either
on a concrete technology or on a theoretical or mathematical tool. Ideally,
tutorials will have a concrete result, such as "Learn to do X with Y"
rather than "Learn language Y".


Just like last year, following the success of the #ShutDownPL event, we are also
inviting proposals for panels and discussions on topics of broader interest
to the PL community.


Tutorials, panels, and discussions may occur before or after ICFP,
co-located with the associated workshops, on September 11 or September 15-16.


----------------------------------------------------------------------


Submission details

 Deadline for submission:     June 24st, 2022

 Notification of acceptance:  July  15th, 2022



Prospective organizers of tutorials are invited to submit a completed
tutorial proposal form in plain text format to the ICFP 2022 workshop
co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou), via email to


             icfp-workshops-2022@googlegroups.com


by June 24st, 2022. Please note that this is a firm deadline.


Organizers will be notified if their event proposal is accepted by
July  8th, 2022.


The proposal form is available at:


http://www.icfpconference.org/icfp2022-files/icfp22-panel-form.txt
http://www.icfpconference.org/icfp2022-files/icfp22-tutorials-form.txt


----------------------------------------------------------------------


Selection committee


The proposals will be evaluated by a committee comprising the
following members of the ICFP 2022 organizing committee.



 Tutorials Co-Chair: Arthur Azevedo de Amorim       (Boston University)

 Tutorials Co-Chair: Zoe Paraskevopoulou      (Northeastern University)

 General Chair:      Andrej Bauer             (University of Ljubljana)

 Program Chair:      Zena M. Ariola              (University of Oregon)


----------------------------------------------------------------------



Further information



Any queries should be addressed to the tutorial co-chairs
(Arthur Azevedo de Amorim and Zoe Paraskevopoulou),
via email to icfp-workshops-2022@googlegroups.com.


^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~2022-06-07  8:34 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2022-06-07  8:34 ICFP 2022: Call for Tutorials, Panels, and Discussions ICFP Publicity

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).