References

  1. Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman (1985): Compilers - Principles, Techniques and Tools. Addison Wesley.
  2. Chris Barker (2004): Continuations in Natural Language. In: Proceedings of the Fourth ACM SIGPLAN Continuations Workshop (CW'04). University of Birmingham Computer Science technical report CSR-04-1.
  3. Josh Berdine, Peter W. O'Hearn, Uday Reddy & Hayo Thielecke (2002): Linear Continuation Passing. Higher-order and Symbolic Computation 15(2/3), pp. 181–208, doi:10.1023/A:1020891112409.
  4. Olivier Danvy & Andrzej Filinski (1990): Abstracting control. In: LISP and functional programming. ACM, pp. 151–160, doi:10.1145/91556.91622.
  5. Olivier Danvy & Andrzej Filinski (1992): Representing Control, a Study of the CPS Transformation. Mathematical Structures in Computer Science 2(4), pp. 361–391, doi:10.1017/S0960129500001535.
  6. Mark Dowd, John McDonald & Justin Schuh (2006): The Art of Software Security Assessment: Identifying and Preventing Software Vulnerabilities. Addison Wesley.
  7. Matthias Felleisen (1988): The theory and practice of first-class prompts. In: Principles of Programming Languages (POPL). ACM, pp. 180–190, doi:10.1145/73560.73576.
  8. Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker & Bruce F. Duba (1986): Reasoning with Continuations. In: Logic in Computer Science (LICS). IEEE.
  9. Andrzej Filinski (1992): Linear Continuations. In: Principles of Programming Languages (POPL), pp. 27–38, doi:10.1145/143165.143174.
  10. Jean-Yves Girard (1987): Linear Logic. Theoretical Computer Science 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  11. Timothy G. Griffin (1990): A Formulae-as-Types Notion of Control. In: Principles of Programming Languages (POPL). ACM, pp. 47–58, doi:10.1145/96709.96714.
  12. William G.J. Halfond, Jeremy Viegas & Alessandro Orso (2006): A Classification of SQL Injection Attacks and Countermeasures. In: ISSSE'06. IEEE.
  13. Samin S. Ishtiaq & Peter O'Hearn (2001): BI as an Assertion Language for Mutable Data Structures. In: Principles of Programming Languages (POPL). ACM, pp. 14–26.
  14. Pierre Jouvelot & David K. Gifford (1988): Reasoning about Continuations with Control Effects. In: Programming Language Design and Implementation (PLDI). ACM, pp. 218–226, doi:10.1145/73141.74837.
  15. Joachim Lambek (1958): The mathematics of sentence structure. American Mathematical Monthly 65, pp. 154–170, doi:10.2307/2310058.
  16. John M. Lucassen & David K. Gifford (1988): Polymorphic Effect Systems. In: Principles of Programming Languages (POPL '88). ACM, pp. 47–57, doi:10.1145/73560.73564.
  17. Gregory Morrisett, F. Smith & D. Walker (2000): Alias Types. In: Proceedings European Symposium on Programming (ESOP), LNCS 1782. Springer, pp. 366–381, doi:10.1007/3-540-46425-5_24.
  18. Peter W. O'Hearn, Hongseok Yang & John C. Reynolds (2004): Separation and Information Hiding. In: POPL'04, pp. 268–280, doi:10.1145/1498926.1498929.
  19. Gordon D. Plotkin (1975): Call-by-name, Call-by-value, and the λ-calculus. Theoretical Computer Science 1(2), pp. 125–159, doi:10.1016/0304-3975(75)90017-1.
  20. David J. Pym (2002): The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, doi:10.1007/978-94-017-0091-7.
  21. John C. Reynolds (1993): The Discoveries of Continuations. Lisp and Symbolic Computation 6(3/4), pp. 233–247, doi:10.1007/BF01019459.
  22. John C. Reynolds (2002): Separation Logic: A Logic for Shared Mutable Data Structures. In: Logic in Computer Science (LICS). IEEE, pp. 55–74, doi:10.1109/LICS.2002.1029817.
  23. Christopher Strachey & C. P. Wadsworth (1974): Continuations: A Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG-11. Oxford University Computing Laboratory.
  24. Zhendong Su & Gary Wassermann (2006): The essence of command injection attacks in web applications. In: Principles of Programming Languages (POPL). ACM, pp. 372–382, doi:10.1145/1111037.1111070.
  25. Hayo Thielecke (2003): From Control Effects to Typed Continuation Passing. In: Principles of Programming Languages (POPL'03). ACM, pp. 139–149, doi:10.1145/640128.604144.
  26. Hayo Thielecke (2014): On the Semantics of Parsing Actions. Science of Computer Programming 84, pp. 52–76, doi:10.1016/j.scico.2013.04.010.
  27. Peter Thiemann (2005): Grammar-based analysis of string expressions. In: TLDI. ACM, pp. 59–70, doi:10.1145/1040294.1040300.
  28. Johan van Benthem (1991): Language in Action. Journal of Philosophical Logic 20(3), pp. 225–263, doi:10.1007/BF00250539.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org