GHC Team, T. The glasgow haskell compiler user's guide, version 4.08. Available online from http://haskell.org/ghc/. Viewed on 12/28/2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(map F (map Fix map F ) v) which takes a polymorphic function as argument. In other words, map Fix has a so called rank 2 type signature [21] Though not in the current language 4 definition of Haskell, rank 2 type signatures are supported by recent versions of the Glasgow Haskell Compiler GHC [34] and the Haskell interpreter Hugs [20] The argument function, map F , has a more general type than one would probably expect: it takes a function of type A 1 A 2 to a function of type F 1 A 1 F 2 A 2 . By contrast, the mapping function for List (which like F has kind # #) takes A 1 A ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 4.04, September 1999. Available from http://www.haskell.org/ghc/ documentation.html.

....by reduction on source terms and is not very intuitive. Rank 2 polymorphism has also been incorporated in the Hugs implementation of Haskell [17] but with explicit type annotations. The GHC implementation of Haskell has recently been released with second order polymorphism at arbitrary ranks [8]; however, types at rank 2 or higher must be given explicitly and the interaction of annotations with implicit types remains unclear. Furthermore, to the best of our knowledge, this has not yet been formalized. Indeed, type inference is undecidable as soon as universal quantifiers may appear at ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 5.04, 2002. Chapter Arbitrary-rank polymorphism.

....by reduction on source terms and is not very intuitive. Rank2 polymorphism has also been incorporated in the Hugs implementation of Haskell [Mar02] but with explicit type annotations. The GHC implementation of Haskell has recently been released with second order polymorphism at arbitrary ranks [GHC02] however, types at rank 2 or higher must be given explicitly and the interaction of annotations with implicit types remains unclear. Furthermore, to the best of our knowledge, this has not yet been formalized. Indeed, type inference is undecidable as soon as universal quantifiers may appear at ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 5.04, 2002. Chapter Arbitrary-rank polymorphism.

....conjecture about tail recursion. His compiler does not preserve tail recursion for any crossmodule procedure call not just those with contracts. Still, he has not found this to be a problem in practice [29, section 3.4. 1] 9 Conclusion Higher order, typed programming language implementations [1, 12, 15, 19, 33] have a static type discipline that prevents certain abuses of the language s primitive operations. For example, programs that might apply non functions, add non numbers, or invoke methods of non objects are all statically rejected. Yet these languages go further. Their run time systems ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, 1999.

....Similarly, if e decomposes into a context and a method return, Elab(P ) must also have returned and the wrapper method s code must have been invoked, so this step is also locally contract sound. 2 Contracts for Higher Order Functions Higher order, typed programming language implementations [2, 20, 23, 33, 51] have a static type discipline that prevents certain abuses of the language s primitive operations. For example, programs that might apply non functions, add non numbers, or invoke methods of non objects are all statically rejected. Yet these languages go further. Their run time systems ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, 1999.

....network. Because of our limitation to 8 processors, it was only possible to compare the four, seven and eight processors version with, respectively, the synchronous versions for one, two and three processors. Our implementation of Haskell# over cluster of PC s uses GHC (Glasgow Haskell Compiler) [GHC Team, 1998], for compilation of functional modules, and MPI(Message Passing Library) Dongarra et al. 1995] for management of parallelism. In Figures 6, 7, 8, graphs for respectively running time, speedup, and efficiency for synchronous Haskell# version of MCP Haskell (solid lines) are compared with ....

GHC Team. (1998). The Glasgow Haskell Compiler User's Guide, Version 4.01. http://www.dcs.gla.ac.uk/fp/software/ghc/4.01/users guide/users guide.html.

....2 a 2 ) Fix f 1 Fix f 2 ) mapFix mapf (In v) In (mapf (mapFix mapf ) v) which takes a polymorphic function as argument. In other words, mapFix has a socalled rank 2 type signature (Leivant, 1983) As an aside, note that Haskell 98 does not support rank 2 types. Recent versions of GHC (Team, 1999) and Hugs (Jones Peterson, 1999) however, provide the necessary extensions. The argument function, mapf , has a more general type than one would probably expect: it takes a function of type a 1 a 2 to a function of type f 1 a 1 f 2 a 2 . By contrast, the mapping function for List (which ....

Team, The GHC. 1999 (September). The glasgow haskell compiler user's guide, version 4.04. Available from http://www.haskell.org/ghc/documentation.html.

....mapf (In v) In (mapf (mapFix mapf ) v) which takes a polymorphic function as argument. In other words, mapFix has a so called rank 2 type signature [16] Though not in the current language definition, rank 2 type signatures are supported by recent versions of the Glasgow Haskell Compiler GHC [28] and the Haskell interpreter Hugs [15] The argument function, mapf , has a more general type than one would probably expect: it takes a function of type a 1 a 2 to a function of type f 1 a 1 f 2 a 2 . By contrast, the mapping function for List (which also has kind ) takes a 1 a 2 to ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 4.04, September 1999. Available from http://www.haskell.org/ghc/documentation. html.

....parametric type, applyList is a higher order look up function that takes a look up function for the base type a and yields a lookup function for List a. Note that applyList has a rank 2 type signature [10] which is not legal Haskell. However, recent versions of the Glasgow Haskell Compiler GHC [16] and the Haskell interpreter Hugs [9] support rank 2 types. ut 3.3 Tabulation Tabulation is the inverse of look up and, in fact, we can derive its de nition by inverse function construction. For the derivation we use a slight reformulation of apply that allows for more structured calculations ....

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 4.04, September 1999. Available from http://www.haskell.org/ghc/documentation.html.

....dist x operators, and the incorporation of a Haskell preprocessor, HsPP, into the Haskell standard. Related issues are discussed, including the provision of a general macro facility for Haskell. 1 Introduction Inspecting the code for a large Haskell system, such as the Glasgow Haskell Compiler [GT98] shows that such systems are not written in pure Haskell. Instead, the occasional appearance of such lines as #include HsVersions.h , or #ifdef DEBUG, and the suspicous nature of such function calls as ASSERT2(x= y, ppr e ppr b) reveal that such code is being preprocessed. In fact, most ....

....p. 595] We suggest that an annotation requiring that the enclosed expression be computed to head normal form at compile time would be useful; if the computation is not possible a compile time error should be raised. Perhaps the syntax should be similar to GHC s cost centre annotations, scc [GT98] say comptime . Semantically, this is (almost) the identity function. Pragmatically, however, the computation is performed at compile time instead of at run time. If the expression evaluates to bottom, the associated error message should be displayed by the compiler (we expect the language will ....

The GHC Team. The Glasgow Haskell Compiler user's guide, version 4.02. Distributed with GHC. Available http://research. microsoft.com/users/t-simonm/ghc/, December 1998.

....The programmer never sees any usage types. 3 The language The language covered by UsageSP is presented in Figure 2. Our language is a variant of the Girard Reynolds polymorphic calculus, extended with many of the features of Core, the intermediate language of the Glasgow Haskell Compiler (GHC) GT98] Compared with the language of [TWM95a] UsageSP replaces nil and cons with general constructors and a corresponding general case construct, adds type abstraction and application, and requires explicit types on lambda abstractions and let bindings. In addition, it permits the application of ....

....to be hidden from the programmer. We have yet to prove this algorithm correct, but we expect the proof to be straightforward. Our prototype implementation is implemented in approximately 2000 non comment lines of Haskell code, 800 of which is the inference proper. For comparison, the GHC compiler [GT98] is approximately 50 000 lines of Haskell; the strictness analyser is about 1400 lines. It was useful to develop the prototype in parallel with the type system itself; several of the design decisions made in the evolution of the type system were clarified and motivated by our practical experience ....

The GHC Team. The Glasgow Haskell Compiler user's guide, version 3.02. Distributed with GHC. Available http://www.dcs.gla.ac.uk/fp/software/ghc/, April 1998.

No context found.

GHC Team, T. The glasgow haskell compiler user's guide, version 4.08. Available online from http://haskell.org/ghc/. Viewed on 12/28/2000.

No context found.

The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 5.04, 2002. Chapter Arbitrary-rank polymorphism.

No context found.

The GHC Team. The Glasgow Haskell Compiler user's guide, version 5.02, 2002. http://www.haskell.org/ghc/docs/latest/set/book-usersguide. html.

No context found.

The Aqua Team. Glasgow Haskell Compiler User's Guide, Version 0.26. Department of Computer Science, Glasgow University, March 1996.

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