| Benjamin C. Pierce and David N. Turner. Local Type Inference. Symposium on Principles of Programming Languages, pages 252--265, ACM, 1998. |
....appears in a method, by the linearity restriction, the method s formal result type will contain at most one occurrence of A, so the actual type of the method application is again of the form T . #. Our type parameter inference scheme is similar to Pierce and Turner s local type inference [PT98]. Pierce and Turner only consider covariant type constructors, which is a sensible assumption for the predominantly functional languages they are dealing with. For GJ, with its exclusive use of invariant type constructors, our special treatment of # is essential to make type inference work. ....
Benjamin C. Pierce and David N. Turner. Local Type Inference. Symposium on Principles of Programming Languages, pages 252--265, ACM, 1998.
....appears in a method, by the linearity restriction, the method s formal result type will contain at most one occurrence of A, so the actual type of the method application is again of the form T . Our type parameter inference scheme is similar to Pierce and Turner s local type inference [PT98]. Pierce and Turner only consider covariant type constructors, which is a sensible assumption for the predominantly functional languages they are dealing with. For GJ, with its exclusive use of invariant type constructors, our special treatment of is essential to make type inference work. ....
Benjamin C. Pierce and David N. Turner. Local Type Inference. Symposium on Principles of Programming Languages, pages 252--265, ACM, 1998.
No context found.
Benjamin C. Pierce and David N. Turner. Local Type Inference. Symposium on Principles of Programming Languages, pages 252--265, ACM, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC