Results 1 -
2 of
2
On Extending Wand’s Type Reconstruction Algorithm to Handle Polymorphic Let
"... Abstract. We have extended Wand’s algorithm to include polymorphic let by extending the constraint language and by using a multi-phase unification algorithm in the constraint solving phase. We show the correctness of our approach by extending the Wand’s soundness and completeness results. We have va ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
Abstract. We have extended Wand’s algorithm to include polymorphic let by extending the constraint language and by using a multi-phase unification algorithm in the constraint solving phase. We show the correctness of our approach by extending the Wand’s soundness and completeness results. We have validated our approach against other popular type reconstruction algorithms by implementing OCaml prototypes and running them on non-trivial examples.
Wand’s Algorithm Extended For the Polymorphic ML-let
, 2007
"... Abstract. This paper details an extension to Wand’s algorithm to handle the polymorphic let (a.k.a. ML-Let) construct. We have extended Wand’s algorithm by extending the constraint language and by using a multi-phase unification algorithm in the constraint solving phase. We show the correctness of o ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. This paper details an extension to Wand’s algorithm to handle the polymorphic let (a.k.a. ML-Let) construct. We have extended Wand’s algorithm by extending the constraint language and by using a multi-phase unification algorithm in the constraint solving phase. We show the correctness of our approach by extending the Wand’s soundness and completeness results. We have validated our approach against other popular type reconstruction algorithms by implementing OCaml prototypes and running them on non-trivial examples. 1
