Zobrazeno 1 - 10
of 673
pro vyhledávání: '"Higher-Order Rewriting"'
This ongoing project aims to define and investigate, from the standpoint of category theory, order theory and universal algebra, the notions of higher-order many-sorted rewriting system and of higher-order many-sorted categorial algebra and their rel
Externí odkaz:
http://arxiv.org/abs/2402.12051
The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments. $\mathtt{BFF}_2$ can be
Externí odkaz:
http://arxiv.org/abs/2401.12385
Autor:
Kop, Cynthia, Vale, Deivid
In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size semantics to call-by-value rewriting: a class of algebraic interpretation
Externí odkaz:
http://arxiv.org/abs/2307.13426
Autor:
Barenbaum, Pablo, Bonelli, Eduardo
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting systems. W
Externí odkaz:
http://arxiv.org/abs/2210.15654
Autor:
Vale, Deivid, Kop, Cynthia
We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to \emph{tuples} of natural numbers and higher-order terms to f
Externí odkaz:
http://arxiv.org/abs/2105.01112
Autor:
Blanqui, Frédéric
We provide a general and modular criterion for the termination of simply-typed $\lambda$ -calculus extended with function symbols defined by user-defined rewrite rules. Following a work of Hughes, Pareto and Sabry for functions defined with a fixpoin
Externí odkaz:
http://arxiv.org/abs/1802.06603
Autor:
Domínguez, Jesús, Fernández, Maribel
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 4 (December 14, 2015) lmcs:1610
We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation
Externí odkaz:
http://arxiv.org/abs/1509.05318
Autor:
Hirschowitz, Tom
Publikováno v:
Logical Methods in Computer Science, Volume 9, Issue 3 (September 4, 2013) lmcs:1132
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.
Externí odkaz:
http://arxiv.org/abs/1307.6318
Autor:
Barenbaum, Pablo, Bonelli, Eduardo
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting systems. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea85a5e9b702ee33cdf6c979413dbcb8
Autor:
Kop, Cynthia, Vale, Deivid
Higher-order rewriting is a framework in which higher-order programs can be described by transformation rules on expressions. A computation occurs by transforming an expression into another using such rules. This step-by-step computation model induce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7befb33dafada77c7e60b6a66f67dca