A theory of linear typings as flows on 3-valent graphs

27 Apr 2018 Zeilberger Noam

Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is the classical notion of an abelian group-valued "flow" on an abstract graph (Tutte, 1954)... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • PROGRAMMING LANGUAGES
  • COMBINATORICS