Towards a Classical Linear λ-calculus (Preliminary Report)

@inproceedings{Bierman1996TowardsAC,
  title={Towards a Classical Linear λ-calculus (Preliminary Report)},
  author={Gavin M. Bierman},
  year={1996}
}
Abstract This paper considers a typed λ-calculus for classical linear logic. I shall give an explanation of a multiple-conclusion formulation for classical logic due to Parigot and compare it to more traditional treatments by Prawitz and others. I shall use Parigot's method to devise a natural deduction formulation of classical linear logic. I shall also demonstrate a somewhat hidden connexion with the continuation-passing paradigm which gives a new computational interpretation of Parigot's… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations

  • C.-H. Luke Ong
  • Computer Science
  • Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996

Towards a Classical Linear lambda-calculus

A Strong Normalization Result for Classical Logic

Linear continuations

Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science

  • J.-Y Girard, Y Lafont, P Taylor
  • Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science
  • 1989