research

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

Authors
Publication date
1 January 2013
Publisher
'Logical Methods in Computer Science e.V.'
Doi
    View on arXiv

    Abstract

    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

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Directory of Open Access Journals

      redirect
      oaioai:doaj.org/article:f375fc286...
      Last time updated on 05/12/2022

      Crossref

      redirect
      oaiinfo:doi/10.2168%2Flmcs-9%283%...
      Last time updated on 01/04/2019

      Episciences.org

      redirect
      oaioai:episciences.org:lmcs:1132
      Last time updated on 02/12/2023

      HAL Université de Savoie

      redirect
      oaioai:HAL:hal-00540205v2
      Last time updated on 09/11/2016

      Hal - Université Grenoble Alpes

      redirect
      oaioai:HAL:hal-00540205v2
      Last time updated on 11/11/2016