{"title":"Node Replication: Theory And Practice","authors":"D. Kesner, Loïc Peyrot, Daniel Ventura","doi":"10.46298/lmcs-20(1:5)2024","DOIUrl":null,"url":null,"abstract":"We define and study a term calculus implementing higher-order node\nreplication. It is used to specify two different (weak) evaluation strategies:\ncall-by-name and fully lazy call-by-need, that are shown to be observationally\nequivalent by using type theoretical technical tools.","PeriodicalId":0,"journal":{"name":"","volume":"81 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.46298/lmcs-20(1:5)2024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
