5 citations · 12 across the 9 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.PL2012★ 2 cited
Normal Form Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Serguei Lenglet
We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilariti…
cs.PL2012★ 1 cited
Expansion for Universal Quantifiers
Sergueï Lenglet, J. B. Wells
Expansion is an operation on typings (i.e., pairs of typing environments and result types) defined originally in type systems for the lambda-calculus with intersection types in ord…
cs.PL2012
Applicative Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Serguei Lenglet
We develop a behavioral theory for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possib…