G. Bell'e, C. B. Jay, and E. Moggi. Functorial ML. In PLILP '96, volume 1140 of LNCS, pages 32--46. Springer Verlag, 1996. TR SOCS-96.08, and accepted for J. Functional Programming. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Non-uniform Recursion: The solution (minimal sorting for fold) - Wehr (2000) (Correct)
....data types. It would be fruitful to extend the present work along suggestive directions from this work namely to look for dual recursion constructs like unfold, recursion constructs for algebraic data type with function types and finally general transformation laws. The work of Moggi et al. [BJM96] on functorial ML has similarities to the present work in a typing discipline which allows type constructor parameters. But still this work does not deal with non uniform recursion. The work on polytypic programming promotes a programming method which is parametric over types [Mee96, JJ96] Again ....
G. Belle, C.B. Jay, and E. Moggi. Functorial ML. In K. Herbert and S.D. Swierstra, editors, Programming Languages: Implementations, Logics, and Programs, volume 1140 of Lecture Notes in Computer Science. Springer-Verlag, 1996. TR SOCS-96.08.
Polytypic Values Possess Polykinded Types - Hinze (2000) (38 citations) (Correct)
....to polytypic values is, to the best of the author s knowledge, original. Previous approaches to polytypic programming (Jansson Jeuring, 1997; Hinze, 2000) were restricted in that they only allowed to parameterize values by types of one xed kind. Two notable exceptions are Functorial ML (FML) (Jay et al. 1998) and the work of F. Ruehr (Ruehr, 1992) FML allows to quantify over functor arities in type schemes (since FML handles only regular, rst order functors, kinds can be simpli ed to arities) However, no formal account of this feature is given and the informal description makes use of an in nitary ....
Jay, C.B., Belle, G., & Moggi, E. (1998). Functorial ML. Journal of functional programming, 8(6), 573-619.
Derivable Type Classes - Hinze, Jones (2000) (36 citations) (Correct)
....extension that allows the programmer to de ne instance declarations for higherorder kinded types. The need for this extension was noted in (Hinze, 1999) but no solution was given. Though there is a considerable amount of work on generic programming (Ruehr, 1992; Cockett Fukushima, 1992; Jay et al. 1998) this is the rst paper we are aware of apart from PolyP (Jansson Jeuring, 1997) that aims at adding generic features to an existing functional language. The PolyP extension o ers a special construct (essentially, a type case) for de ning generic functions. The resulting de nitions are ....
Jay, C., Belle, G. and Moggi, E. (1998) Functorial ML. Journal of Functional Programming 8(6):573-619.
Covariant Types - Barry Jay School (1997) Self-citation (Jay) (Correct)
No context found.
G. Bell'e, C. B. Jay, and E. Moggi. Functorial ML. In PLILP '96, volume 1140 of LNCS, pages 32--46. Springer Verlag, 1996. TR SOCS-96.08, and accepted for J. Functional Programming.
Functorial Lambda-Calculus - Jay School Of Self-citation (Jay) (Correct)
No context found.
G. Bell'e, C. B. Jay, and E. Moggi. Functorial ML. In PLILP '96, volume 1140 of LNCS, pages 32--46. Springer Verlag, 1996. TR SOCS96. 08, and accepted for J. Functional Programming.
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