posted by user: hossein_haeri || 1376 views || tracked by 1 users: [display]

LSFA 2018 : 13th Workshop on Logical and Semantic Frameworks, with Applications


When Sep 26, 2018 - Sep 28, 2018
Where Fortaleza, Brazil
Submission Deadline Jun 10, 2018
Notification Due Jul 25, 2018
Final Version Due Aug 12, 2018
Categories    automated deduction   semantic frameworks   programming languages   computational logic

Call For Papers

LSFA 2018
13th Workshop on Logical and Semantic Frameworks, with Applications
26-28 September 2018, Fortaleza, Brazil

Logical and semantic frameworks are formal languages used to represent
logics, languages and systems. These frameworks provide foundations
for the formal specification of systems and programming languages,
supporting tool development and reasoning.

Previous editions took place in Brasília (2017, collocated with
Tableaux+FroCoS+ITP), Porto (2016), Natal (2015), Brasília (2014), São
Paulo (2013), Rio de Janeiro (2012), Belo Horizonte (2011), Natal
(2010), Brasília (2009), Salvador (2008), Ouro Preto (2007), and Natal
(2006). See for more information.


Topics of interest include, but are not limited to:

* Automated deduction
* Applications of logical and/or semantic frameworks
* Computational and logical properties of semantic frameworks
* Formal semantics of languages and systems
* Implementation of logical and/or semantic frameworks
* Lambda and combinatory calculi
* Logical aspects of computational complexity
* Logical frameworks
* Process calculi
* Proof theory
* Semantic frameworks
* Specification languages and meta-languages
* Type theory


Contributions should be written in English and submitted in the form
of full papers with a maximum of 16 pages including references. Beyond
full regular papers, we encourage submissions such as proof pearls,
rough diamonds, original surveys, or overviews of research projects,
where the focus is more on elegance and dissemination than on novelty.
Papers belonging to this second category are expected to be short,
that is, of a maximum of 6 pages including references, unless they
also contain some novel results.

For both paper categories, additional technical material can be
provided in a clearly marked appendix which will be read by reviewers
at their discretion. Contributions must also be unpublished and not
submitted simultaneously for publication elsewhere.

Papers should be prepared in LaTeX using the generic ENTCS package
( The submission should be in the
form of a PDF file uploaded to Easychair:

The workshop pre-proceedings, containing the reviewed extended
abstracts, will be handed-out at workshop registration. After the
workshop the authors of both full and short papers will be invited to
submit full versions of their works for the post-proceedings to be
published in ENTCS. At least one of the authors should register for
the conference.

For the reviewing process, the traditional system will be enriched
with the possibility for the reviewers to interact with the authors
via an anonymous forum associated to each paper.


* Submission: June 10
* Notification: July 25
* Camera ready version: August 12
* LSFA 2018: September 26-28

After the publication of the ENTCS proceedings, the authors of
selected papers will be invited to submit revised papers for a special
issue. Previous LSFA special issues have been published in journals
such as J. IGPL and TCS (see


* Yiannis Moschovakis, University of California, Los Angeles &
University of Athens.
* Andreas Herzig, CNRS, IRIT, Université de Toulouse.
* Alessandra Palmigiano, Delft University of Technology.
* Amy Felty, University of Ottawa.


* Beniamino Accattoli, Inria & Ecole Polytechnique, co-chair
* Carlos Olarte, Universidade Federal do Rio Grande do Norte, co-chair
* Sandra Alves, University of Porto
* Mario Alvim, Universidade Federal de Minas Gerais
* Carlos Areces, Universidad Nacional de Córdoba
* Mauricio Ayala-Rincon, Universidade de Brasilia
* Eduardo Bonelli, Universidad Nacional de Quilmes & Stevens Institute
of Technology
* Iliano Cervesato, Carnegie Mellon University
* Francicleber Ferreira, Universidade Federal do Ceará
* Marcelo Finger, Universidade de São Paulo
* Renata Freitas, Universidade Federal Fluminense
* Marco Gaboardi, University at Buffalo, SUNY
* Erich Grädel, RWTH Aachen University
* Oleg Kiselyov, Tohoku University
* Ugo Dal Lago, Inria & Bologna University
* Sonia Marin, IT-University of Copenhagen
* Claudia Nalon, Universidade de Brasilia
* Revantha Ramanayake, Vienna University of Technology
* Umberto Rivieccio, Universidade Federal do Rio Grande do Norte
* Camilo Rueda, Pontificia Universidad Javeriana
* Matthieu Sozeau, Inria & Université Paris Diderot
* Carolyn Talcott, SRI International
* Alvaro Tasistro, Universidad ORT Uruguay
* Alicia Villanueva, Universitat Politècnica de València
* Renata Wassermann, University of São Paulo


* Francicleber Ferreira, Universidade Federal do Ceará
* Carlos Brito, Universidade Federal do Ceará
* Paulo T. Guerra, Universidade Federal do Ceará
* Viviane Menezes, Universidade Federal do Ceará


* lsfa2018 at

Related Resources

ICSC 2021   International Conference on Semantic Computing
CCNET 2020   7th International Conference on Computer Networks & Communications
SA-TTA 2021   The 9th track on Software Architecture: Theory, Technology, and Applications (SA-TTA) at the 36th ACM/SIGAPP Symposium On Applied Computing (SAC 2021)
IJPLA 2020   International Journal of Programming Languages and Applications
MVA 2021   17th International Conference on Machine Vision Applications
ITAS--EI Compendex, Scopus 2021   2021 Information Technology & Applications Symposium (ITAS 2021)--EI Compendex, Scopus
SI:ICPR-MVAP 2021   Special Issue on Selected Papers from 25th ICPR in Machine Vision and Applications
AMSTA 2021   15th International Conference on Agents and Multi-Agent Systems: Technology and Applications
CiVEJ 2020   Civil Engineering and Urban Planning: An International Journal
SCSN 2021   The 9th IEEE International Workshop on Semantic Computing for Social Networks and Organization Sciences: from user information to social knowledge