Cartesian closed 2-categories and permutation equivalence in higher-order rewriting

DOI10.2168/LMCS-9(3:10)2013zbMath1272.68184arXiv1307.6318MaRDI QIDQ2846582

Tom Hirschowitz

Publication date: 6 September 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.6318

zbMATH Keywords

lambda calculushigher-order rewritingcategorical semanticscombinatory reduction systemsCartesian closed 2-categories

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Coherence for bicategorical cartesian closed structure ⋮ Bicategorical type theory: semantics and syntax ⋮ Relative full completeness for bicategorical Cartesian closed structure ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ High-level signatures and initial semantics

This page was built for publication: Cartesian closed 2-categories and permutation equivalence in higher-order rewriting