Coercions in a polymorphic type system

@article{Luo2008CoercionsIA,
  title={Coercions in a polymorphic type system},
  author={Zhaohui Luo},
  journal={Mathematical Structures in Computer Science},
  year={2008},
  volume={18},
  pages={729-751}
}
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The traditional type system with let-polymorphism is extended with argument coercions and function coercions, and a corresponding type inference algorithm is presented and proved to be sound and complete. 

From This Paper

Figures, tables, and topics from this paper.

References

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

Coercive subtyping

  • Z. Luo
  • Journal of Logic and Computation, 9(1):105–130
  • 1999
Highly Influential
6 Excerpts

Computation and Reasoning: A Type Theory for Computer Science

  • Z. Luo
  • Oxford University Press
  • 1994
Highly Influential
3 Excerpts

An implementation of LF with coercive subtyping and universes

  • Z. Luo
  • Journal of Automated Reasoning
  • 2001

Similar Papers

Loading similar papers…