First International Conference on Formal Structures for Computation and Deduction (FSCD 2016)

June 22-26, 2016

Porto, Portugal

Call For Papers

FSCD (http://fscdconference.org/ ) 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, proof theory and new emerging models of computation such as quantum computing or homotopy type theory. The name of the new conference comes from an unpublished but important book by G´erard Huet that strongly influenced many research in the domain

Topics

1. Calculi
   1. Lambda-calculus
   2. Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.)
   3. Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.)
   4. Proof theory (natural deduction, sequent calculus, proof nets, etc.)
   5. Type theory and logical frameworks
   6. Homotopy type theory
   
   
2. Methods in Computation and Deduction
   1. Type systems (polymorphism, dependent, recursive, intersection, session, etc.)
   2. Induction, coinduction
   3. Matching, unification, completion, orderings
   4. Strategies (normalization, completeness, etc.)
   5. Tree automata
   6. Model building and model checking
   7. Proof search (resolution, paramodulation, narrowing, focusing, etc.)
   8. Constraint solving and decision procedures
   
   
3. Semantics
   1. Operational semantics and abstract machines
   2. Game Semantics and applications
   3. Domain theory and categorical models
   4. Quantitative models (timing, probabilities, resources, etc.)
   5. Quantum computation and emerging models in computation
4. Algorithmic Analysis and Transformations of Formal Systems
   1. Type Inference and type checking
   2. Abstract Interpretation
   3. Complexity analysis and implicit computational complexity
   4. Checking termination, confluence, derivational complexity and related properties
   5. Symbolic computation
   
   
5. Tools and Applications
   1. Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.)
   2. Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.)
   3. Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.)
   4. Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications)
   5. Certifications (theorems, rewriting techniques, etc.)
   6. Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.)

IMPORTANT DATES            

Paper submission: 12 February 2016 

                       

Notification of acceptance:6 April 2016 

                                  

Conference dates: June 22-26, 2016

User Name : MANI
Posted on

Related CFPs

NCS 2026   18th International Conference on Network and Communications Security
IJSPTM   International Journal of Security, Privacy and Trust Management
SOFEA 2026   12th International Conference on Software Engineering and Applications (SOFEA 2026)
NCOM 2026   12th International Conference on Networks & Communications