Difference between revisions of "CSL 2011"
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
}} | }} | ||
The 25th International Workshop on Computer Science Logic (CSL) 2011 | The 25th International Workshop on Computer Science Logic (CSL) 2011 | ||
| + | |||
| + | |||
| + | ==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 | ||
| + | *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 foundations of programming paradigms | ||
| + | *logical aspects of quantum computing | ||
| + | *verification and program analysis | ||
| + | *linear logic | ||
| + | *higher-order logic | ||
| + | *nonmonotonic reasoning | ||
Revision as of 11:50, 18 August 2021
| CSL 2011 | |
|---|---|
25th International Workshop on Computer Science Logic
| |
| Ordinal | 25 |
| Event in series | CSL |
| Dates | 2011/09/12 (iCal) - 2011/09/15 |
| Presence | presence |
| Homepage: | https://www.eacsl.org/csl11/ |
| Location | |
| Location: | Bergen, Norway |
| Table of Contents | |
,
The 25th International Workshop on Computer Science Logic (CSL) 2011
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
- 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 foundations of programming paradigms
- logical aspects of quantum computing
- verification and program analysis
- linear logic
- higher-order logic
- nonmonotonic reasoning