A formulae-as-type notion of control

@inproceedings{Griffin1989AFN,
  title={A formulae-as-type notion of control},
  author={T. Griffin},
  booktitle={POPL '90},
  year={1989}
}
  • T. Griffin
  • Published in POPL '90 1989
  • Computer Science
  • The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with first-class labels and jumps. We show that the well-known formulae-as-types correspondence, which relates a constructive proof of a formula α to a program of type α, can be extended to a typed Idealized Scheme. What is surprising about this correspondence is that it relates classical proofs to typed programs… CONTINUE READING
    Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
    • 606
    • PDF
    Type Systems for Programming Languages
    • 298
    Explicit polymorphism and CPS conversion
    • 81
    • Highly Influenced
    • PDF
    Categorical Structure of Continuation Passing Style
    • 107
    • PDF
    An evaluation semantics for classical proofs
    • 133
    • PDF
    Classical Proofs as Programs
    • 98
    The Revised Report on the Syntactic Theories of Sequential Control and State
    • 514
    • PDF
    Polymorphic type assignment and CPS conversion
    • 72
    • PDF

    References

    Publications referenced by this paper.
    Call-by-Name, Call-by-Value and the lambda-Calculus
    • 1,090
    • Highly Influential
    • PDF