Author:
Biernacki Dariusz,Lenglet Sergueï
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Information and Computation 105, 159–267 (1993)
2. Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science 1(2:5), 1–39 (2005)
3. Biernacki, D., Danvy, O., Millikin, K.: A dynamic continuation-passing style for dynamic delimited continuations. Technical Report BRICS RS-05-16, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark (May 2005)
4. Lecture Notes in Computer Science;D. Biernacki,2012
5. Biernacki, D., Lenglet, S.: Normal form bisimulations for delimited-control operators (February 2012),
http://arxiv.org/abs/1202.5959
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献