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

lmcs:1132 - Logical Methods in Computer Science, September 4, 2013, Volume 9, Issue 3 - https://doi.org/10.2168/LMCS-9(3:10)2013
Cartesian closed 2-categories and permutation equivalence in higher-order rewritingArticle

Authors: Tom Hirschowitz ORCID

    We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.

    https://doi.org/10.2168/LMCS-9(3:10)2013
    Source: arXiv.org:1307.6318
    Volume: Volume 9, Issue 3
    Published on: September 4, 2013
    Imported on: October 5, 2010
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages,Mathematics - Category Theory
    Licence: arXiv.org - Non-exclusive license to distribute
    Funding:
      Source : OpenAIRE Graph
    • Realizability for classical logic, concurrency, references and rewriting; Funder: French National Research Agency (ANR); Code: ANR-11-BS02-0010
    • Formal Verification of Distributed Components; Funder: French National Research Agency (ANR); Code: ANR-10-BLAN-0305

    11 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1527 times.
    This article's PDF has been downloaded 654 times.