Abstract Operational Methods for Call-by-Push-Value

保存先:
書誌詳細
出版年:arXiv.org (Oct 26, 2024), p. n/a
第一著者: Goncharov, Sergey
その他の著者: Tsampas, Stelios, Urbat, Henning
出版事項:
Cornell University Library, arXiv.org
主題:
オンライン・アクセス:Citation/Abstract
Full text outside of ProQuest
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

MARC

LEADER 00000nab a2200000uu 4500
001 3119818243
003 UK-CbPIL
022 |a 2331-8422 
035 |a 3119818243 
045 0 |b d20241026 
100 1 |a Goncharov, Sergey 
245 1 |a Abstract Operational Methods for Call-by-Push-Value 
260 |b Cornell University Library, arXiv.org  |c Oct 26, 2024 
513 |a Working Paper 
520 3 |a Levy's call-by-push-value is a comprehensive programming paradigm that combines elements from functional and imperative programming, supports computational effects and subsumes both call-by-value and call-by-name evaluation strategies. In the present work, we develop modular methods to reason about program equivalence in call-by-push-value, and in fine-grain call-by-value, which is a popular lightweight call-by-value sublanguage of the former. Our approach is based on the fundamental observation that presheaf categories of sorted sets are suitable universes to model call-by-(push)-value languages, and that natural, coalgebraic notions of program equivalence such as applicative similarity and logical relations can be developed within. Starting from this observation, we formalize fine-grain call-by-value and call-by-push-value in the higher-order abstract GSOS framework, reduce their key congruence properties to simple syntactic conditions by leveraging existing theory and argue that introducing changes to either language incurs minimal proof overhead. 
653 |a Imperative programming 
653 |a Equivalence 
653 |a Congruences 
700 1 |a Tsampas, Stelios 
700 1 |a Urbat, Henning 
773 0 |t arXiv.org  |g (Oct 26, 2024), p. n/a 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3119818243/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://arxiv.org/abs/2410.17045