Zobrazeno 1 - 10
of 120
pro vyhledávání: '"Bonelli, Eduardo"'
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
Publikováno v:
EPTCS 357, 2022
This volume contains the post-proceedings of the Sixteenth Logical and Semantic Frameworks with Applications (LSFA 2021). The meeting was held online on July 23-24, 2021, organised by the Universidad de Buenos Aires, Argentina. LSFA aims to bring res
Externí odkaz:
http://arxiv.org/abs/2204.03415
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 2 (April 18, 2024) lmcs:7089
When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of $\lambda$-calculus translated to proof-nets, these inessential details are captured by a notion of equivalence on $\lambda$-terms
Externí odkaz:
http://arxiv.org/abs/2101.05754
The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. This is achieved by introducing a relation $\simeq$, defined over a revised presentation of Parigot's $\lambda\mu$-calculu
Externí odkaz:
http://arxiv.org/abs/1906.09370
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that can opera
Externí odkaz:
http://arxiv.org/abs/1704.09026
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the form $x\,y$ which decompose a compound data structure into its parts. Typ
Externí odkaz:
http://arxiv.org/abs/1601.03271
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study normalisation of multistep strategies, strategies that reduce a set of redexes at a time, focussing on the notion of necessary sets, those which contain at least one redex that cannot be avoided in order to reach a normal form. This is parti
Externí odkaz:
http://arxiv.org/abs/1412.2118
This volume contains a selection of the papers presented at the Ninth International Workshop on Developments in Computational Models (DCM 2013) held in Buenos Aires, Argentina on 26th August 2013, as a satellite event of CONCUR 2013. Several new mode
Externí odkaz:
http://arxiv.org/abs/1403.7685
Publikováno v:
In Theoretical Computer Science 16 August 2019 781:111-130
