Node Replication: Theory And Practice

07/14/2022
by   Delia Kesner, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2022

A Generic Type System for Higher-Order Ψ-calculi

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many ...
research
10/20/2017

Transparent Replication Using Metaprogramming in Cyan

Replication can be used to increase the availability of a service by cre...
research
07/26/2018

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

Recent advances in smart cities applications enforce security threads su...
research
07/05/2021

A Theory of Higher-Order Subtyping with Type Intervals (Extended Version)

The calculus of Dependent Object Types (DOT) has enabled a more principl...
research
08/06/2015

Replication and Generalization of PRECISE

This report describes an initial replication study of the PRECISE system...
research
04/20/2023

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

[Context] Study replication is essential for theory building and empiric...
research
10/19/2022

On Bisimulation in Absence of Restriction

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

Please sign up or login with your details

Forgot password? Click here to reset