International conference on Formal Structures for Computation and Deduction

About FSCD

FSCD covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation (e.g. quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g. blockchain protocols or deep learning algorithms).

Programme Chair

  • Zena M. Ariola, University of Oregon

Programme Committee

  • M. Alpuente, University of Valencia
  • S. Alves, University of Porto
  • A. Bauer, University of Ljubljana
  • M. P. Bonacina, University of Verona
  • P-L. Curien, University Paris-Diderot
  • P. Dybjer, Chalmers University
  • U. De’Liguoro, University of Torino
  • M. Fernandez, King’s College London
  • M. Gaboardi, University of Buffalo
  • D. Ghica, University of Birmingham
  • S. Ghilezan, University of Novi Sad
  • J. Giesl, RWTH Aachen
  • S. Guerrini, University Paris 13
  • R. Harper, Carnegie Mellon University
  • M. Hasegawa, Kyoto University
  • N. Hirokawa, JAIST
  • P. Johann, Appalachian State University
  • O. Kammar, University of Oxford
  • D. Kesner, University Paris-Diderot
  • C. Kop, Radboud University
  • O. Laurent, ENS Lyon
  • D. Licata, Wesleyan University
  • A. Middeldorp, University of Innsbruck
  • J. Mitchell, Stanford University
  • K. Nakata, SAP Postdam
  • M. Pagani, University Paris-Diderot
  • E. Pimentel, U. Federal Rio Grande Do Norte
  • F. van Raamsdonk, Vrije University Amsterdam
  • G. Rosu, University of Illinois
  • A. Sabry, Indiana University
  • A. Stump, University of Iowa
  • P. Urzyczyn, University of Warsaw
  • T. Uustalu, Reykjavik University
  • S. Zdancewic, University of Pennsylvania