메뉴 건너뛰기
LISP and Symbolic Computation
Volumn 6, Issue 3-4, 1993, Pages 289-360
Reasoning about programs in continuation-passing style
Author keywords

calculus; v C calculus; v calculus; continuation passing style; CPS transformations; inverse CPS transformations; IOCC
Indexed keywords

EID: 0000307929     PISSN: 08924635     EISSN: 15730557     Source Type: Journal    
DOI: 10.1007/BF01019462     Document Type: Article
Times cited : (198)
References (49)
  • 1
    • 84931392631 scopus 로고    scopus 로고
    • Allison, L. A Practical Introduction to Denotational Semantics. Volume 23 of Cambridge Computer Science Texts, Cambridge University Press (1986).
  • 2
    • 84931368816 scopus 로고    scopus 로고
    • Appel, A. Compiling with Continuations. Cambridge University Press (1992).
  • 3
    • 84931379079 scopus 로고    scopus 로고
    • Appel, A. and Jim, T. Continuation-passing, closure-passing style. In Conference Record of the 16th ACM Symposium on Principles of Programming Languages (1989) 293–302.
  • 4
    • 84931435971 scopus 로고    scopus 로고
    • Barendregt, H. P. The Lambda Calculus: Its Syntax and Semantics. Volume 103 of Studies in Logic and the Foundations of Mathematics, North-Holland, revised edition (1984).
  • 5
    • 84931339667 scopus 로고    scopus 로고
    • Bartley, D. H. and Jensen, J. C. The implementation of PC Scheme. In Proceedings of the ACM Conference on Lisp and Functional Programming (1986) 86–93.
  • 6
    • 84931408115 scopus 로고    scopus 로고
    • Boehm, H.-J. and Demers, A. Implementing Russel. In Proceedings of the ACM Sigplan Symposium on Compiler Construction, Sigplan Notices, 21, 7 (1986) 186–195.
  • 7
    • 84931358738 scopus 로고    scopus 로고
    • Bondorf, A. Improving binding times without explicit CPS-conversion. In Proceedings of the ACM Conference on Lisp and Functional Programming (1992) 1–10.
  • 8
    • 84931419226 scopus 로고    scopus 로고
    • Clinger, W., Friedman, D., and Wand, M. A scheme for a higher-level semantic algebra. In Reynolds, J. and Nivat, M., editors, Algebraic Methods in Semantics, Cambridge University Press (1985) 237–250.
  • 9
    • 84931344979 scopus 로고    scopus 로고
    • Crank, E. and Felleisen, M. Parameter-passing and the lambda calculus. In Conference Record of the 18th ACM Symposium on Principles of Programming Languages (1991) 233–244.
  • 11
    • 84931358387 scopus 로고    scopus 로고
    • Danvy, O. Back to direct style. Science of Computer Programming (1993). To appear. Preliminary version in: Proceedings of the 4th European Symposium on Programming, 1992. Lecture Notes in Computer Science, 582, Springer Verlag.
  • 12
    • 84931329676 scopus 로고    scopus 로고
    • Danvy, O. and Filinski, A. Abstracting control. In Proceedings of the ACM Conference on Lisp and Functional Programming (1990) 151–160.
  • 14
    • 84931437797 scopus 로고    scopus 로고
    • Danvy, O. and Lawall, J. Back to direct style II: First-class continuations. In Proceedings of the ACM Conference on Lisp and Functional Programming (1992) 299–310.
  • 15
    • 84931396629 scopus 로고    scopus 로고
    • Felleisen, M. The theory and practice of first-class prompts. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages (1988) 180–190.
  • 16
    • 84931345270 scopus 로고    scopus 로고
    • Felleisen, M. and Friedman, D. P. Control operators, the SECD-machine, and the λ-calculus. In Wirsing, M., editor, Formal Description of Programming Concepts-III, North-Holland (1986) 193–217.
  • 17
    • 84931401702 scopus 로고    scopus 로고
    • Felleisen, M. and Friedman, D. P. A syntactic theory of sequential state. Theoretical Computer Science, 69, 3 (1989) 243–287. Preliminary version in: Conference Record of the 14th ACM Symposium on Principles of Programming Languages, 1987.
  • 18
    • 84931293216 scopus 로고    scopus 로고
    • Felleisen, M. and Hieb, R. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 102 (1992) 235–271. Technical Report 89–100, Rice University.
  • 19
    • 84931293773 scopus 로고    scopus 로고
    • Felleisen, M., Friedman, D. P., Kohlbecker, E., and Duba, B. A syntactic theory of sequential control. Theoretical Computer Science, 52, 3 (1987) 205–237. Preliminary version: Reasoning with Continuations, in Proceedings of the 1st IEEE Symposium on Logic in Computer Science. 1986.
  • 20
    • 84931342890 scopus 로고    scopus 로고
    • Felleisen, M., Wand, M., Friedman, D.P., and Duba, B.F. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proceedings of the ACM Conference on Lisp and Functional Programming (1988) 52–62.
  • 21
    • 84931355230 scopus 로고    scopus 로고
    • Fischer, M. Lambda calculus schemata. In Proceedings of the ACM Conference on Proving Assertions About Programs, Sigplan Notices, 7, 1 (1972) 104–109. Expanded version in LISP and Symbolic Computation (this issue).
  • 22
    • 84931418862 scopus 로고    scopus 로고
    • Flanagan, C., Sabry, A., Duba, B. F., and Felleisen, M. The essence of compiling with continuations. In Proceedings of the ACM Sigplan Conference on Programming Language Design and Implementation (1993). To appear.
  • 23
    • 84931452463 scopus 로고    scopus 로고
    • Friedman, D. P., Haynes, C.T., and Kohlbecker, E. Programming with continuations. In Pepper, P., editor, Program Transformations and Programming Environments, Springer-Verlag (1985) 263–274.
  • 24
    • 84931369622 scopus 로고    scopus 로고
    • Friedman, D. P., Wand, M., and Haynes, C.T. Essentials of Programming Languages. The MIT Press (1992).
  • 25
    • 84931353249 scopus 로고    scopus 로고
    • Galbiati, L. and Talcott, C. L. A simplifier for untyped lambda expressions. In Proceedings Conditional Term Rewriting Systems, Lecture Notes in Computer Science, 516 (1990) 342–353.
  • 26
    • 84931384741 scopus 로고    scopus 로고
    • Griffin, T.G. A formulae-as-type notion of control. In Conference Record of the 17th ACM Symposium on Principles of Programming Languages (1990) 47–58.
  • 28
    • 84931397064 scopus 로고    scopus 로고
    • Hieb, R., Dybvig, K., and Bruggeman, C. Representing control in the presence of first-class continuations. In Proceedings of the ACM Sigplan Conference on Programming Language Design and Implementation (1990) 66–77.
  • 29
    • 84931413111 scopus 로고    scopus 로고
    • Kelsey, R. and Hudak, P. Realistic compilation by program transformation. In Conference Record of the 16th ACM Symposium on Principles of Programming Languages (1989) 281–292.
  • 30
    • 84931361854 scopus 로고    scopus 로고
    • Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J., and Adams, N. Orbit: An otpimizing compiler for Scheme. In Proceedings of the ACM Sigplan Symposium on Compiler Construction, Sigplan Notices, 21, 7 (1986) 219–233.
  • 32
    • 84931389911 scopus 로고    scopus 로고
    • Leroy, X. The Zinc Experiment: An Economical Implementation of the ML Language. Technical Report 117, INRIA (1990).
  • 36
    • 84931386766 scopus 로고    scopus 로고
    • Moggi, E. Computational lambda-calculus and monads. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science (1989) 14–23. Also appeared as: LFCS Report ECS-LFCS-88-86, University of Edinburgh, 1988.
  • 37
    • 84931296807 scopus 로고    scopus 로고
    • Morris, L. The next 700 formal language descriptions. Lisp and Functional Programming (1993). In this issue. Original manuscript dated November 1970.
  • 41
    • 84931366250 scopus 로고    scopus 로고
    • Reynolds, J. C. Definitional interpreters for higher-order programming languages. In Proceedings of the ACM Annual Conference (1972) 717–740.
  • 42
    • 84931298142 scopus 로고    scopus 로고
    • Sabry, A. and Felleisen, M. Reasoning about programs in continuationpassing style. In Proceedings of the ACM Conference on Lisp and Functional Programming (1992) 288–298. Technical Report 92–180, Rice University.
  • 43
    • 84931296539 scopus 로고    scopus 로고
    • Shivers, O. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, Carneige-Mellon University (1991).
  • 44
    • 84931367603 scopus 로고    scopus 로고
    • Sitaram, D. and Felleisen, M. Reasoning with continuations II: Full abstraction for models of control. In Proceedings of the ACM Conference on Lisp and Functional Programming (1990) 161–175.
  • 45
    • 84931424251 scopus 로고    scopus 로고
    • Steel, T.B., editor. Formal Language Description Languages for Computer Programming. North-Holland (1966).
  • 46
    • 84931379337 scopus 로고    scopus 로고
    • Steele Jr., Guy L. Rabbit: A Compiler for Scheme. MIT AI Memo 474. Massachusetts Institute of Technology (1978).
  • 47
    • 84931402777 scopus 로고    scopus 로고
    • Strachey, C. and Wadsworth, C.P. Continuations: A Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group (1974).
  • 48
    • 84931389645 scopus 로고    scopus 로고
    • Talcott, C. L. A theory for program and data specification. Theoretical Computer Science, 104 (1992) 129–159. Preliminary version in Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, (Lecture Notes in Computer Science, 429, 1990).
  • 49
    • 84931450042 scopus 로고    scopus 로고
    • Wand, M. Correctness of procedure representations in higher-order assembly language. In Brookes, S., editor, Proceedings of the Conference on the Mathematical Foundations of Programing Semantics, Lecture Notes in Computer Science, 598, Springer Verlag (1992) 294–311.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.