What is the meaning of these constant interruptions?

Journal of Functional Programming

Volumn 17, Issue 6, 2007, Pages 777-792

  Hutton, Graham ^a   Wright, Joel ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTNESS THEOREM; HIGH LEVEL SEMANTICS; MODULAR PROGRAMS;

FUNCTIONAL PROGRAMMING;

SEMANTICS;

EID: 35348940769     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796807006363     Document Type: Article

References (54)

1. Ager, M. S., Biernacki, D., Danvy, O. & Midtgaard, J. (2003) From Interpreter to Compiler and Virtual Machine: a Functional Derivation. Technical Report RS-03-14. BRICS, Aarhus, Denmark.
2. Aiken, A., Wimmers, E. L. & Williams, J. H. (1990) Program Transformation in the Presence of Errors. In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, pp. 210-217.
3. Allison, L. (1989) Direct semantics and exceptions define jumps and coroutines. Information Processing Letters, 31, 327-330.
4. Ancona, D., Lagorio, G. & Zueca, E. (2001) A core calculus for Java exceptions. SIGPLAN Notices, 36(11), 16-30.
5. Appel, A. (1992) Compiling With Continuations. Cambridge University Press.
6. Auwaerter, J. F. (1976) American National Standard - Programming Language PL/I. ANSI X3.53-1976. New York: American National Standards Institute.
7. Backhouse, R. (2003) Program Construction: Calculating Implementations From Specifications. New York: John Wiley.
8. Borger, E. & Schulte, W. (2000) A practical method for specification and analysis of exception handling: A Java/JVM case study. IEEE Trans. Software Eng. 26(9), 872-887.
9. Chase, D. (1994a) Implemention of exception handling, Part I. J. C. Language Trans. 5(4), 229-240.
10. Chase, D. (1994b) Implemention of exception handling, Part II. J. C. Language Trans. 6(1), 20-32.
11. Claessen, K. & Hughes, J. (2000) QuickCheck: A lightweight tool for random testing of Haskell programs. In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming. ACM Press.
12. Cleaveland, R., Luttgen, G. & Natarajan, V. (2001) Priority in process algebra. In: Handbook of Process Algebra, Bergstra, J. A., Ponse, A. & Smolka, S. A. (eds), Elsevier, pp. 711-765.
13. Cristian, F. (1989) Exception handling. Anderson, T. (ed), Dependability of Resilient Computers. Blackwell Scientific Publications, pp. 68-97.
14. Drew, S., Gouph, K. J. & Ledermann, J. (1995) Implementing Zero Overhead Exception Handling. Tech. Rept. 95-12. Faculty of Information Technology, Queensland University of Technology.
15. Drew, S. J. & Gough, K. J. (1994) Exception Handling: Expecting The Unexpected. Comp. languages. 20(2), 69-87.
16. Drossopoulou, S. & Valkevych, T. (2000) Java Exceptions Throw No Surprises. Technical report. Department of Computing, Imperial College of Science, Technology and Medicine.
17. Dybvig, R. K. & Hieb, R. (1989) Engines from continuations. J. Comput. languages, 14(2), 109-123.
18. Goodenough, J. B. (1975) Exception handling: Issues and a proposed notation. Commun. ACM, 18(12), 683-696.
19. Gordon, A. (1995) Bisimilarity as a Theory of Functional Programming. BRICS Notes Series NS-95-3. Aarhus University.
20. Haynes, C. T. & Friedman, D. P. (1984) Engines build Process Abstractions. In: Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming. ACM Press, pp. 18-24.
21. Hinze, R. & Löh, A. (2006) The lhs2TeX System for Typesetting Haskell. Available at: http ://www.cs.uu.nl/"andres/lhs2tex/.
22. Hoare, C. A. R. (1985) Communicating Sequential Processes. Prentice-Hall.
23. Hutton, G. (2007) Programming in Haskell. Cambridge University Press.
24. Hutton, G. & Wright, J. (2004) Compiling exceptions correctly. In: Proceedings of the 7th International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science, vol. 3125. Stirling, Scotland: Springer.
25. Hutton, G. & Wright, J. (2006) Calculating an exceptional machine. Loidl, Hans-Wolfgang (ed), Trends in Functional Programming volume 5. Selected papers from the Fifth Symposium on Trends in Functional Programming, Munich, November 2004. Bristol: Intellect.
26. Jacobs, B. & Poll, E. (2003) Java Program Verification at Nijmegen: Developments and Perspective. Technical Report NIII-R0318. Nijmegen Institute for Computing and Information Sciences.
27. Jacobs, B. (2001) A formalisation of Java's exception mechanism. In: ESOP 2001: Proceedings of the 10th European Symposium on Programming Languages and Systems. Springer-Verlag, pp. 284-301.
28. Klein, G. & Nipkow, T. (2006) A machine-checked model for a Java-like language, virtual machine and compiler. ACM Trans. Program. Languages Syst. 28(4): 619-695.
29. Laird, J. (2001) A fully abstract game semantics of local exceptions. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society.
30. Laird, J. (2002) Exceptions, Continuations and Macro-expressiveness. In: Proceedings of the 11th European Symposium on Programming Languages and Systems. Springer Verlag.
31. Leino, K., Rustan, M. & van de Snepscheut, Jan L. A. (1994) Semantics of exceptions. In: Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi. North-Holland, pp. 447-466.
32. Lillibridge, M. (1999) Unchecked exceptions can be strictly more powerful than Call/CC. Higher-Order Symbolic Comput. 12(1), 75-104.
33. Marlow, S., Peyton Jones, S., Moran, A. & Reppy, J. (2001) Asynchronous exceptions in Haskell. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press.
34. McBride, C., McKinna, J. & Altenkirch, T. (2006) The epigram system. Available at: http://www.e-pig.org/.
35. McKinna, J. & Wright, J. (2006, July) Towards type-correct, provably correct, compilers: A case study in epigram. J. Funct. Program.
36. Milner, R. (1989) Communication and Concurrency. Prentice Hall.
37. Milner, R. (1999) Communicating and Mobile Systems: The π-Calculus. Cambridge University Press.
38. Milner, R., Tofte, M., Harper, R. & MacQueen, D. (1997) The Definition of Standard ML (Revised). MIT Press.
39. Moran, A., Lassen, S. B. & Jones, S. L. P. (1999) Imprecise exceptions, co-inductively. Electron. Notes Theor. Comp. Sci. 26.
40. Nipkow, T. (2004) Compiling exceptions correctly. Archive of Formal Proofs. Available at: http://afp.sourceforge.net/.
41. Palsberg, J. & Ma, D. (2002) A typed interrupt calculus. In: Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. Springer-Verlag, pp. 291-310.
42. Pessaux, F. & Leroy, X. (2000) Type-based analysis of uncaught exceptions. ACM Trans. Program. Languages Syst. 22(2), 340-377.
43. Peyton Jones, S. (2001) Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. In: Engineering Theories of Software Construction Hoare, T., Broy, M. & Steinbruggen, R. (eds), IOS Press. Presented at the 2000 Marktoberdorf Summer School.
44. Peyton Jones, S., Reid, A., Hoare, T., Marlow, S. & Henderson, F. (1999) A semantics for imprecise exceptions. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press.
45. Ramsey, N. & Jones, S. P. (2000) A single intermediate language that supports multiple implementations of exceptions. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation. ACM Press, pp. 285-298.
46. Reynolds, J. C. (1972) Definitional interpreters for higher-order programming languages. In: Proceedings of the ACM Annual Conference. ACM Press, pp. 717-740.
47. Riecke, J. G. & Thielecke, H. (1999) Typed exceptions and continuations cannot macro-express each other. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming. Springer Verlag.
48. Sebesta, R. W. (2006) Concepts of Programming Languages, 7th ed. Pearson Addison Wesley.
49. Spivey, M. (1990) A functional theory of exceptions. Sci. Comput. Program. 14(1), 25-43.
50. Thielecke, H. (2000) On exceptions versus continuations in the presence of state. In: Proceedings of the 9th European Symposium on Programming Languages and Systems. Springer Verlag.
51. Troelstra, A. S. & van Dalen, D. (1988) Constructivism in Mathematics: An Introduction. Vol. 1. Elsevier.
52. Wand, M. (1995) Compiler correctness for parallel languages. In: Proceedings of the 7th International Conference on Functional Programming and Computer Architecture. ACM Press.
53. Wright, A. K. & Felleisen, M. (1994) A syntactic approach to type soundness. Inform. Comput., 115(1), 38-94.
54. Yi, K. & Ryu, S. (2002) A cost-effective estimation of uncaught exceptions in standard ML programs. Theor. Comput. Sci. 277(1-2), 185-217.