From Algol to polymorphic linear lambda-calculus

@article{OHearn2000FromAT,
  title={From Algol to polymorphic linear lambda-calculus},
  author={Peter W. O'Hearn and John C. Reynolds},
  journal={J. ACM},
  year={2000},
  volume={47},
  pages={167-223}
}
In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their results. This is reminiscent of state transformations in imperative languages, where execition of an assignment statement alters the contents of the store. We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types. On the one hand, the translations lead to a semantic analysis of Algol-like… CONTINUE READING
Highly Cited
This paper has 80 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

81 Citations

0510'98'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

A Category-Theoretic Approach to the Semantics of Pro- gramming Languages

F. J. Oles
Ph.D. thesis, Syracuse University, Syracuse, • 1982
View 20 Excerpts
Highly Influenced

The essence of Algol

J. C. Reynolds
Algorithmic Languages, • 1981
View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…