[Apologies if you receive multiple copies of this announcement]
=======================================================================
Call for papers
Logical Frameworks and Meta-Languages: Theory and Practice
LFMTP 2018
Oxford, UK, 7 July 2018
Affiliated with FSCD 2018 (part of FLoC)
http://lfmtp.org/workshops/2018/
=======================================================================
SUBMISSION DEADLINE: 16 APRIL 2018
Logical frameworks and meta-languages form a common substrate for
representing, implementing and reasoning about a wide variety of
deductive systems of interest in logic and computer science. Their
design, implementation and their use in reasoning tasks, ranging from
the correctness of software to the properties of formal
systems, have been the focus of considerable research over the last two
decades. This workshop will bring together designers, implementors and
practitioners to discuss various aspects impinging on the structure and
utility of logical frameworks, including the treatment of variable
binding, inductive and co-inductive reasoning techniques and the
expressiveness and lucidity of the reasoning process.
LFMTP 2018 will provide researchers a forum to present state-of-the-art
techniques and discuss progress in areas such as the following:
* Encoding and reasoning about the meta-theory of programming languages,
logical systems and related formally specified systems.
* Theoretical and practical issues concerning the treatment of variable
binding, especially the representation of, and reasoning about,
datatypes defined from binding signatures.
* Logical treatments of inductive and co-inductive definitions and
associated reasoning techniques, including inductive types of higher
dimension in homotopy type theory.
* Graphical languages for building proofs, applications in geometry,
equational reasoning and category theory.
* New theory contributions: canonical and substructural frameworks,
contextual frameworks, proof-theoretic foundations supporting
binders, functional programming over logical frameworks,
homotopy and cubical type theory.
* Applications of logical frameworks: proof-carrying architectures, proof
exchange and transformation, program refactoring, etc.
* Techniques for programming with binders in functional programming
languages such as Haskell, OCaml or Agda, and logic programming
languages such as lambda Prolog or Alpha-Prolog.
Invited Speakers
TBA
Important Dates
Abstract submission deadline: Monday April 9th
Submission deadline: Monday April 16th
Notification to authors: Monday May 14th
Final version due: Monday June 4th
Workshop date: Saturday July 7th
Submission
In addition to regular papers, we accept the submission of "work in progress"
reports, in a broad sense. Those do not need to report fully polished
research results, but should be of interest for the community at large.
Submitted papers should be in PDF, formatted using the EPTCS style
guidelines. The length is restricted to 15 pages for regular papers and
8 pages for "Work in Progress" papers. Submission is via EasyChair:
https://easychair.org/conferences/?conf=lfmtp18.
Proceedings
Accepted regular papers will be included in the proceedings of LMFTP
2018, whose mode of publication will be determined shortly.
Program Committee
* MarÃa Alpuente (Universitat Politècnica de València, Spain)
* Andrej Bauer (University of Ljubljana, Slovenia)
* Frédéric Blanqui (Inria, France), co-chair
* Ana Bove (Chalmers University of Technology, Sweden)
* Stéphane Graham-Lengrand (CNRS, France)
* Makoto Hamana (Gunma University, Japan)
* Chantal Keller (Université Paris-Sud, France)
* Carlos Olarte (Universidade Federal do Rio grande do Norte, Brazil)
* Giselle Reis (CMU Qatar), co-chair
* Aaron Stump (University of Iowa, USA)
* Yuting Wang (Yale University, USA)
--
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:
Post Comments (Atom)
No comments:
Post a Comment