BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2022/newsitem/13063/2-
 --5-August-2022-Seventh-International-Conference-o
 n-Formal-Structures-for-Computation-and-Deduction-
 FSCD-2022-Haifa-Israel
DTSTAMP:20211101T032349
SUMMARY:Seventh International Conference on Formal
  Structures for Computation and Deduction (FSCD 20
 22), Haifa, Israel
DTSTART;VALUE=DATE:20220802
DTEND;VALUE=DATE:20220805
LOCATION:Haifa, Israel
DESCRIPTION:FSCD covers all aspects of formal stru
 ctures for computation and deduction from theoreti
 cal foundations to applications. Building on two c
 ommunities, RTA (Rewriting Techniques and Applicat
 ions) and TLCA (Typed Lambda Calculi and Applicati
 ons), FSCD embraces their core topics and broadens
  their scope to closely related areas in logics, m
 odels of computation, semantics and verification i
 n new challenging areas.  Submissions must be form
 atted using the LIPIcs style files. Submissions ca
 n be made in two categories. Regular research pape
 rs are limited to 15 pages, excluding references a
 nd appendices. They must present original research
  which is unpublished and not submitted elsewhere.
  System descriptions are limited to 15 pages, excl
 uding references. They must present new software t
 ools, or significantly new versions of such tools,
  in which FSCD topics play an important role. An a
 rchive of the code with instructions on how to ins
 tall and run the tool must be submitted. In additi
 on, a webpage where the system can be experimented
  with should be provided.  The suggested, but not 
 exclusive, list of topics for submission is:  1. C
 alculi  2. Methods in Computation and Deduction  3
 . Semantics  4. Algorithmic Analysis and Transform
 ations of Formal Systems  5. Tools and Application
 s  6. Semantics and Verification in new challengin
 g areas
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p><a href="
 http://fscd-conference.org/" target="_blank">FSCD<
 /a> covers all aspects of formal structures for co
 mputation and deduction from theoretical foundatio
 ns to applications. Building on two communities, R
 TA (Rewriting Techniques and Applications) and TLC
 A (Typed Lambda Calculi and Applications), FSCD em
 braces their core topics and broadens their scope 
 to closely related areas in logics, models of comp
 utation, semantics and verification in new challen
 ging areas.</p>\n</div><div>\n  <p>Submissions mus
 t be formatted using the <a href="https://submissi
 on.dagstuhl.de/series/details/5#author" target="_b
 lank">LIPIcs style files</a>. Submissions can be m
 ade in two categories. Regular research papers are
  limited to 15 pages, excluding references and app
 endices. They must present original research which
  is unpublished and not submitted elsewhere. Syste
 m descriptions are limited to 15 pages, excluding 
 references. They must present new software tools, 
 or significantly new versions of such tools, in wh
 ich FSCD topics play an important role. An archive
  of the code with instructions on how to install a
 nd run the tool must be submitted. In addition, a 
 webpage where the system can be experimented with 
 should be provided.</p>\n\n  <p>The suggested, but
  not exclusive, list of topics for submission is:<
 br>\n  1. Calculi<br>\n  2. Methods in Computation
  and Deduction<br>\n  3. Semantics<br>\n  4. Algor
 ithmic Analysis and Transformations of Formal Syst
 ems<br>\n  5. Tools and Applications<br>\n  6. Sem
 antics and Verification in new challenging areas</
 p>\n</div>
URL:https://fscd2022.github.io/
END:VEVENT
END:VCALENDAR
