Difference between revisions of "CSL 2012"

From Openresearch
Jump to navigation Jump to search
(Created page with "{{Event |Acronym=CSL 2012 |Title=26th International Workshop on Computer Science Logic |Ordinal=26 |Series=CSL |Type=Workshop |Start date=2012/09/03 |End date=2012/09/06 |Subm...")
 
Line 18: Line 18:
  
 
==Topics==
 
==Topics==
 +
Topics of interest include (but are not limited to):
 +
*automated deduction and interactive theorem proving
 +
*constructive mathematics and type theory
 +
*equational logic and term rewriting
 +
*automata and games, game semantics
 +
*modal and temporal logic
 +
*model checking
 +
*decision procedures
 +
*logical aspects of computational complexity
 +
*finite model theory
 +
*computational proof theory
 +
*Bounded arithmetic and propositional proof complexity
 +
*logic programming and constraints
 +
*lambda calculus and combinatory logic
 +
*domain theory
 +
*categorical logic and topological semantics
 +
*database theory
 +
*specification, extraction and transformation of programs
 +
*logical aspects of quantum computing
 +
*logical foundations of programming paradigms
 +
*verification and program analysis
 +
*linear logic
 +
*higher-order logic
 +
*nonmonotonic reasoning
 +
 +
 
==Submissions==
 
==Submissions==
 
==Important Dates==
 
==Important Dates==

Revision as of 09:51, 24 August 2021

CSL 2012
26th International Workshop on Computer Science Logic
Ordinal 26
Event in series CSL
Dates 2012/09/03 (iCal) - 2012/09/06
Presence presence
Homepage: http://csl2012.lacl.fr/
Location
Location: Fontainebleau, France
Loading map...

Important dates
Submissions: 2012/04/09
Table of Contents

,



The 26th International Workshop on Computer Science Logic (CSL) 2012


Topics

Topics of interest include (but are not limited to):

  • automated deduction and interactive theorem proving
  • constructive mathematics and type theory
  • equational logic and term rewriting
  • automata and games, game semantics
  • modal and temporal logic
  • model checking
  • decision procedures
  • logical aspects of computational complexity
  • finite model theory
  • computational proof theory
  • Bounded arithmetic and propositional proof complexity
  • logic programming and constraints
  • lambda calculus and combinatory logic
  • domain theory
  • categorical logic and topological semantics
  • database theory
  • specification, extraction and transformation of programs
  • logical aspects of quantum computing
  • logical foundations of programming paradigms
  • verification and program analysis
  • linear logic
  • higher-order logic
  • nonmonotonic reasoning


Submissions

Important Dates