Elaborating evaluation-order polymorphism

@inproceedings{Dunfield2015ElaboratingEP,
  title={Elaborating evaluation-order polymorphism},
  author={Joshua Dunfield},
  booktitle={ICFP 2015},
  year={2015}
}
  • Joshua Dunfield
  • Published in ICFP 2015
  • Computer Science
  • We classify programming languages according to evaluation order: each language fixes one evaluation order as the default, making it transparent to program in that evaluation order, and troublesome to program in the other. This paper develops a type system that is impartial with respect to evaluation order. Evaluation order is implicit in terms, and explicit in types, with by-value and by-name versions of type connectives. A form of intersection type quantifies over evaluation orders, describing… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Intersection types and computational effects

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Practical refinement-type checking

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Simple imperative polymorphism

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

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

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Review of "Some Properties of Conversion" by Alo

    • P. Bernays
    • 1996
    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Functional Characters of Solvable Terms

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Review of “Some Properties of Conversion

    • P. Bernays
    • by Alonzo Church and J.B. Rosser. J. Symbolic Logic,
    • 1936
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Integrating strict and lazy evaluation: the λsl-calculus

    • A. Asperti
    • In Programming Language Implementation and Logic Programming,
    • 1990
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL