DeepAI AI Chat

Node Replication: Theory And Practice

07/14/2022

∙

by Delia Kesner, et al.

∙

∙

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.

Delia Kesner
13 publications
Loïc Peyrot
2 publications
Daniel Ventura
3 publications

page 1

page 2

page 3

page 4

∙ 09/06/2022

A Generic Type System for Higher-Order Ψ-calculi

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many ...

0 Alex Rønning Bendixen, et al. ∙

∙ 10/20/2017

Transparent Replication Using Metaprogramming in Cyan

Replication can be used to increase the availability of a service by cre...

0 Fellipe A. Ugliara, et al. ∙

∙ 07/26/2018

Automatic Detection of Node-Replication Attack in Vehicular Ad-hoc Networks

Recent advances in smart cities applications enforce security threads su...

0 Mohammed GH. I. Al Zamil, et al. ∙

∙ 08/06/2015

Replication and Generalization of PRECISE

This report describes an initial replication study of the PRECISE system...

0 Michael Minock, et al. ∙

∙ 01/15/2018

Conceptualizing and Evaluating Replication Across Domains of Behavioral Research

We discuss the authors' conceptualization of replication, in particular ...

0 Jennifer L. Tackett, et al. ∙

∙ 04/20/2023

Replication and Verifiability in Requirements Engineering: the NLP for RE Case

[Context] Study replication is essential for theory building and empiric...

0 Sallam Abualhaija, et al. ∙

∙ 10/19/2022

On Bisimulation in Absence of Restriction

We revisit the standard bisimulation equalities in process models free o...

0 Xian Xu, et al. ∙