A static semantics for Haskell
暂无分享,去创建一个
[1] Lennart Augustsson,et al. Implementing Haskell overloading , 1993, FPCA '93.
[2] Mark P. Jones,et al. Typing Haskell in Haskell , 1999 .
[3] Jerzy Tiuryn,et al. Type reconstruction in the presence of polymorphic recursion , 1993, TOPL.
[4] J. Y. Girard,et al. Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .
[5] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.
[6] Simon Peyton Jones,et al. A static semantics for Haskell , 1992 .
[7] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.
[8] Simon L. Peyton Jones,et al. Type classes in Haskell , 1994, TOPL.
[9] Thomas Johnsson,et al. Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.
[10] Mark P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism , 1993, FPCA '93.
[11] Mark P. Jones. Coherence for Qualiied Types , 1993 .
[12] Mark P. Jones. Coherence for qualified types , 2001 .
[13] Philip Wadler,et al. How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.
[14] John Hughes,et al. Report on the Programming Language Haskell 98 , 1999 .