2019/04/15 by Giulio Guerrieri, Giulio Manzonetto
Computer Science · #cs.LO #cs.DM #cs.PL
paper · pdf · doi:10.4204/eptcs.292.2
published as EPTCS 292, 2019, pp. 15-30 · In Proceedings Linearity-TLLA 2018, arXiv:1904.06159
arxiv created 2019/04/15 · arxiv updated 2019/04/16
We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-operator that allows both call-by-name and call-by-value lambda-calculi to be encoded in. We investigate how the bang calculus subsumes both call-by-name and call-by-value lambda-calculi from a syntactic and a semantic viewpoint.