Author:
Chang Stephen,Barzilay Eli,Clements John,Felleisen Matthias
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Allwood, T.O., Peyton Jones, S., Eisenbach, S.: Finding the needle: stack traces for GHC. In: Proc. 2nd Symp. on Haskell, pp. 129–140 (2009)
2. Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: The call-by-need λ calculus. In: Proc. 22nd POPL, pp. 233–246 (1995)
3. Augustson, M., Reinfelds, J.: A visual miranda machine. In: Proc. Software Education Conference SRIG-ET, pp. 233–246 (1995)
4. Chitil, O., Luo, Y.: Structure and properties of traces for functional programs. In: Proc. 3rd Intl. Works. Term Graph Rewriting, pp. 39–63 (2006)
5. Clements, J.: Portable and High-level Access to the Stack with Continuation Marks. Ph.D. thesis, Northeastern University (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Is functional programming better for modularity?;Proceedings of the 6th Workshop on Evaluation and Usability of Programming Languages and Tools;2015-10-26