# 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} }

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

#### Topics from this paper.

509 Citations

Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

- Computer Science
- 1992

- 606
- PDF

The Revised Report on the Syntactic Theories of Sequential Control and State

- Mathematics, Computer Science
- 1992

- 514
- PDF

#### References

##### Publications referenced by this paper.

Call-by-Name, Call-by-Value and the lambda-Calculus

- Mathematics, Computer Science
- 1975

- 1,090
- Highly Influential
- PDF