A theory of linear typings as flows on 3-valent graphs
- Submitting institution
-
The University of Birmingham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 51709794
- Type
- E - Conference contribution
- DOI
-
10.1145/3209108.3209121
- Title of conference / published proceedings
- LICS '18 : Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
- First page
- 919
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper develops a novel connection between the fields of lambda calculus and graph theory, specifically between typing of linear lambda terms and coloring of graphs. It is significant because it provides theoretical underpinnings to recently discovered correspondences between lambda calculus and the combinatorics of graphs on surfaces, and in particular a reformulation of the Four Colour Theorem as a statement about typing linear terms (Zeilberger,
JFP, 2016). The paper won a Birmingham EPS College Paper of the Month award, and forms the basis for a current ANR JCJC grant application that has been retained for the second round.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -