Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science 2022
DOI: 10.1145/3531130.3532469
|View full text |Cite
|
Sign up to set email alerts
|

Resource approximation for the λμ-calculus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…This Commutation theorem enables one to deduce properties of some λ-terms from the properties of their Taylor expansion; typically, properties of the (possibly) non-terminating execution of a λ-term, previously characterized by coinductive objects like its Böhm tree, are proved via the Taylor expansion by mere induction. This approach has been successfully applied not only to the ordinary λ-calculus [ER06; Oli18; Oli20; BM20], but also to nondeterministic [BEM12; VA19], probabilistic [DZ12; DL19], call-by-value [KMP20], and call-by-push-value [CT20] calculi, as well as Parigot's λμ-calculus [Bar22].…”
Section: Introductionmentioning
confidence: 99%
“…This Commutation theorem enables one to deduce properties of some λ-terms from the properties of their Taylor expansion; typically, properties of the (possibly) non-terminating execution of a λ-term, previously characterized by coinductive objects like its Böhm tree, are proved via the Taylor expansion by mere induction. This approach has been successfully applied not only to the ordinary λ-calculus [ER06; Oli18; Oli20; BM20], but also to nondeterministic [BEM12; VA19], probabilistic [DZ12; DL19], call-by-value [KMP20], and call-by-push-value [CT20] calculi, as well as Parigot's λμ-calculus [Bar22].…”
Section: Introductionmentioning
confidence: 99%