Delia Kesner ; Loïc Peyrot ; Daniel Ventura - Node Replication: Theory And Practice

lmcs:9803 - Logical Methods in Computer Science, January 23, 2024, Volume 20, Issue 1 - https://doi.org/10.46298/lmcs-20(1:5)2024
Node Replication: Theory And PracticeArticle

Authors: Delia Kesner ; Loïc Peyrot ORCID; Daniel Ventura

    We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies:
    call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools.

    https://doi.org/10.46298/lmcs-20(1:5)2024
    Source: arXiv.org:2207.07143
    Volume: Volume 20, Issue 1
    Published on: January 23, 2024
    Accepted on: August 2, 2023
    Submitted on: July 18, 2022
    Keywords: Computer Science - Logic in Computer Science, 03B70, F.3.2, F.4.1, D.3.1
    Licence: Attribution 4.0 International (CC BY 4.0)

    Classifications

    Mathematics Subject Classification 20201
    Sources:
    • [1] zbMATH Open.

    Share and export

    Consultation statistics

    This page has been seen 2283 times.
    This article's PDF has been downloaded 567 times.