Extensible denotational language specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 789 LNCS, Issue , 1994, Pages 244-272

  Cartwright, Robert ^a   Felleisen, Matthias ^a,b  

^a RICE UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; SPECIFICATIONS;

CONTROL OPERATORS; DENOTATIONAL SEMANTICS; EXTENDED LANGUAGES; FUNCTIONAL LANGUAGES; LANGUAGE SPECIFICATION; NEW FORMATS; PURELY FUNCTIONAL;

SEMANTICS;

EID: 85011382459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57887-0_99     Document Type: Conference Paper

References (41)

1. ALLISON, L. A Practical Introduction to Denotational Semantics. Cambridge Computer Science Texts 23. Cambridge University Press, Cambridge, England. 1986.
2. ALLISON, L. Direct semantics and exceptions define jumps and coroutines. Information Processing Letters 31, 1989, 327-330.
3. Bjørner, D. and C. JONES. Formal Specification and Software Development. Prentice Hall International, 1982.
4. BLIKLE, A. and A. TAPLECKI. Naive denotational semantics. In Proc. IFIP 9th World Computer Congress: Information Processing 83, North- Holland, Amsterdam, 1983, 345-355.
5. CRANK, E. and M. FELLEISEN. Parameter-passing and the lambdacalculus. In Proc. 18th ACM Symposium on Principles of Programming Languages, 1991, 233-245.
6. DEMICHIEL, L.G. Overview: The Common Lisp Object System. Lisp and Symbolic Computation 1(3/4), 1988, 227-244.
7. Dybvig, R. K. The Scheme Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey, 1987.
8. DYBVIG, R. K. and R. HIES. Engines from continuations. Journal of Computer Languages (Pergamon Press) 14(2), 1989, 109-124.
9. FELLEISEN, M. and D.P. FRIEDMAN. A reduction semantics for imperative higher-order languages. In Proc. Conference on Parallel Architectures and Languages Europe, Volume II: Parallel Languages. Lecture Notes in Computer Science 259. Springer-Verlag, Heidelberg, 1987, 206-223.
10. FELLEISEN, M. and D.P. FRIEDMAN. A syntactic theory of sequential state. Theor. Comput. Sci. 69(3), 1989, 243-287. Preliminary version in: Proc. 14th ACM Symposium on Principles of Programming Languages, 1987, 314-325.
11. FELLEISEN, M. and R. HIES. The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University, June 1989. Theor. Comput. Sci. 102, 1992, 235-271.
12. FELLEISEN, M., D.P. FRIEDMAN, E. KOHLBECKER, and B. DUBA. A syntactic theory of sequential control. Theor. Comput. Sci. 52(3), 1987, 205-237. Preliminary version in: Proc. Symposium on Logic in Computer Science, 1986, 131-141.
13. FILINSKI, A. Representing monads. In Proc. 21st ACM Symposium on Principles of Programming Languages, 1994, to appear.
14. FRIEDMAN, D.P., C.T. HAYNES, and E. KOHLBECKER. Programming with continuations. In Program Transformations and Programming Environments, edited by P. Pepper. Springer-Verlag, Heidelberg, 1985, 263-274.
15. GORDON, M.J. The Denotational Description of Programming Languages, Springer-Verlag, New York, 1979.
16. HAYNES, C.T., D.P. FRIEDMAN, and M. WAND. Obtaining corontines from continuations. Journal of Computer Languages (Pergamon Press) 11, 1986, 143-153.Preliminary Version in Lisp and Functional Programming, 1984, Austin, TX.
17. KANNEGANTI, A., and A. CARTWRIGHT. What is a universal higherorder programming language? In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science 700. Springer Verlag, Berlin, 1993, 682-695.
18. MEYER, A.R. and M. WAND. Continuation semantics in typed lambdacalculi. Proc. Workshop Logics of Programs, Lecture Notes in Computer Science 193, Springer-Verlag, Heidelberg, 1985, 219-224.
19. MILNER, R., M. TOFTE, and R. HARPER. The Definition of Standard ML. The MIT Press, Cambridge, Massachusetts and London, England, 1990.
20. Moggi, E. An abstract view of programming languages. LFCS Report ECS-LFCS-90-113, University of Edinburgh, 1990.
21. MOGGI, E. Notions of computations and monads. Inf. and Comp. 93, 1991, 55-92.
22. MOGGI, E.: Computational lambda-calculus and monads. In Proc. Fourth Symposium on Logic in Computer Science, 1989, 14-23.
23. MossEs, P. Denotational Semantics. In Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1991, 575-631.
24. ω as a Universal Domain. J. Comput. Syst. Sci. 17, 1978, 209-236.
25. REES, J. and W. CLINGER (Eds.). The revised a report on the algorithmic language Scheme. SIGPLAN Notices 21(12), 1986, 37-79.
26. REYNOLDS, J.C. On the relation between direct and continuation semantics. In Proc. International Conference on Automata, Languages and Programming, 1974, 141-156.
27. SCHMIDT, D.A. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986.
28. SCOTT, D. S. Domains for denotational semantics. In Proc. International Conference on Automata, Languages, and Programming, Lecture Notes in Mathematics 140, Springer Verlag, Berlin, 1982, 577-613.
29. SCOTT, D.S. Datatypes as lattices. SIAM J. Comput. 5(3), 1976, 522-587.
30. SETHI a. and A. Tang.: Constructing call-by-value continuation semantics. J. ACM 27(3), 1980, 580-597.
31. SITARAM, D. and M. FELLEISEN. Modeling continuations without continuations. In Proc. 18th ACM Symposium on Principles of Programming Languages, 1991, 185-196.
32. STEELE, G.L Jr. Common Lispn The Language. Digital Press, 1984.
33. STEELE, G.L Jr. Building interpreters by composing monads. In Proc. 21st ACM Symposium on Principles of Programming Languages, 1994, to appear.
34. STOY, J. The congruence of two programming language definitions. Theor. Comput. Sci. 13, 1981, 151-174.
35. STOY, J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Languages. The MIT Press, Cambridge, Mass. 1981.
36. STRACHEY, C. and C.P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, 1974.
37. SUSSMAN, G.J. and G.L. Steele Jr. Scheme: An interpreter for extended lambda calculus. Memo 349, MIT AI Lab, 1975.
38. WADLER, P. The essence of functional programming. In Proc. 19th ACM Symposium on Principles of Programming Languages, 1992, 1-14.
39. WAND, M. Continuation-based multiprocessing. In Proc. 1980 ACM Conference on Lisp and Functional Programming, 1980, 19-28.
40. WRIGHT, A. and M. FELLEISEN. A syntactic approach to type soundness. Technical Report 160. Rice University, 1991. Information and Computation, 1993, to appear.
41. WRIGHT, A.K. and R. CARTWRIGHT. A practical soft type system for Scheme. Technical Report Rice CS 93-218. Rice University, December 1993.