categories - Category Theory list
 help / color / mirror / Atom feed
* [LICS] LICS 2019 Registration and Website Mirror
@ 2019-04-05 20:33 Sam Staton
  0 siblings, 0 replies; only message in thread
From: Sam Staton @ 2019-04-05 20:33 UTC (permalink / raw)
  To: las-lics, categories, GAMES, ProofTheory.List, types-announce,
	theory-logic, theorem-provers, concurrency, finite-model-theory,
	asl, agda, appsem, lfcs-interest, cade, prog-lang,
	linear@cs.stanford.edu

CALL FOR PARTICIPATION 
    
Thirty-Fourth Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS)
    
Conference 24-27 June 2019, Vancouver
Workshops 22-23 June 2019
    
LICS 2019 Registration is open. 
Registration page:
https://ungerboeck.its.sfu.ca/emc00/register.aspx?OrgCode=01&EvtID=132686&AppCode=REG&CC=119040326516

We also encourage participants to find accommodation in Vancouver as soon as possible.
Local info page (with accommodation suggestions): 
https://www.sfu.ca/~lics2019/

The LICS server at siglog is temperamental at present. Apologies. While we're investigating, I've put a mirror at
http://www.cs.ox.ac.uk/people/samuel.staton/licstemp/lics19/
Accepted papers:
http://www.cs.ox.ac.uk/people/samuel.staton/licstemp/lics19/accepted.html
Original website:
https://lics.siglog.org/lics19/

Workshops:
LFMTP: Logical Frameworks and Metalanguages: Theory and Practice 
LMW: Logic Mentoring Workshop 
MoRe: Multi-objective reasoning in verification and synthesis 
LearnAut: Learning and Automata
LOLA: Syntax and semantics of Low level Languages 
WiL: Women in Logic 



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

only message in thread, other threads:[~2019-04-05 20:33 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2019-04-05 20:33 [LICS] LICS 2019 Registration and Website Mirror Sam Staton

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).