Grant: Discovery Grants Program - Individual
University of Ottawa
$29,000.00
Polarized logics, geometry of interaction, and the dynamics of resource sensitive computation
FY 2011-12
Summary
In this proposal we look at proofs as dynamical systems, interacting by the cut-elimination process. We study
the dynamics of proofs, their complexity, and the dynamical invariants of normalization, via an algebraic framework.
This is part of the general theory of logic in computer science, in which we think of proofs as programs. More generally, this is part of a larger program to understand the topological and dynamical behaviour of the kinds of graphs and structures arising from interpreting logic in this manner. For example, in programming languages developed in this style of resource sensitivity, to know one has constructed a program of a given type correctly is to be assured it will
meet some strict complexity restrictions. In general, we study algebraic and dynamical structures which arise when one has networks with feedback, which are ubiquitous, from analog computing to systems biology.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
8544-2011
Name nom
Scott, Philip
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2011
Award amount
29000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Partie
1
Nb partie
5
Application title
Polarized logics, geometry of interaction, and the dynamics of resource sensitive computation
Keyword
NSERC
Application summary
In this proposal we look at proofs as dynamical systems, interacting by the cut-elimination process. We study
the dynamics of proofs, their complexity, and the dynamical invariants of normalization, via an algebraic framework.
This is part of the general theory of logic in computer science, in which we think of proofs as programs. More generally, this is part of a larger program to understand the topological and dynamical behaviour of the kinds of graphs and structures arising from interpreting logic in this manner. For example, in programming languages developed in this style of resource sensitivity, to know one has constructed a program of a given type correctly is to be assured it will
meet some strict complexity restrictions. In general, we study algebraic and dynamical structures which arise when one has networks with feedback, which are ubiquitous, from analog computing to systems biology.