Grant: Discovery Grants Program - Individual
University of Calgary
$50,000.00
Categorical programming and computability
EF 2013-14
Résumé
This research concerns the applications of Category Theory to Computer Science and to programming language semantics. It has three main (related) directions:(1) Abstract Computability: Pieter Hofstra and I recently developed an abstract approach to computability using ""Turing categories"". These allow a unified view of a wide variety of existing computational models, for which, hitherto, there was no common basis. The development follows earlier work with Steve Lack in which a powerful yet simple algebraic formulation for systems of partial maps was introduced. The aim is to use these developments to further unify and broaden the applicability of theoretical techniques in this area.(2) Linear Logic and the Semantics of Concurrency: This is a continuation of a research program initiated jointly with Robert Seely, and Rick Blute to explore linear logic and its relation to computation. Recently Craig Pastro and I used these ideas to show how concurrent programming primitives can be modeled. This work takes us closer to an objective of this program: the development of formal concurrent languages based on this semantics.(3) The Semantics of Low Complexity Programs: In current work, with Brian Redmond, we are investigating the categorical semantics of low complexity settings using polarized categories and affine linear logic. Already an implementation of a pilot (polynomial time) programming language based on this semantics has been undertaken by Mike Burrell. The continued theoretical exploration of polynomial time from a categorical perspective is proposed supported by the development of its programming language which makes these ideas more widely accessible.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
105415-2009
Name nom
Cockett, Robin
Department département
Computer Science
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2009
Award amount
50000
Program id
RGPIN
Program name 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
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
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
5
Nb partie
5
Application title
Categorical programming and computability
Keyword
NSERC
Application summary
This research concerns the applications of Category Theory to Computer Science and to programming language semantics. It has three main (related) directions:(1) Abstract Computability: Pieter Hofstra and I recently developed an abstract approach to computability using ""Turing categories"". These allow a unified view of a wide variety of existing computational models, for which, hitherto, there was no common basis. The development follows earlier work with Steve Lack in which a powerful yet simple algebraic formulation for systems of partial maps was introduced. The aim is to use these developments to further unify and broaden the applicability of theoretical techniques in this area.(2) Linear Logic and the Semantics of Concurrency: This is a continuation of a research program initiated jointly with Robert Seely, and Rick Blute to explore linear logic and its relation to computation. Recently Craig Pastro and I used these ideas to show how concurrent programming primitives can be modeled. This work takes us closer to an objective of this program: the development of formal concurrent languages based on this semantics.(3) The Semantics of Low Complexity Programs: In current work, with Brian Redmond, we are investigating the categorical semantics of low complexity settings using polarized categories and affine linear logic. Already an implementation of a pilot (polynomial time) programming language based on this semantics has been undertaken by Mike Burrell. The continued theoretical exploration of polynomial time from a categorical perspective is proposed supported by the development of its programming language which makes these ideas more widely accessible.