Search results
Jump to navigation
Jump to search
- As of 2015-11-14 both language extensions (StrictData and Strict) are merged in GHC Head (in time for GHC 8.0).8 KB (1,152 words) - 13:09, 24 March 2018
- ...HaskellDirect groks both the OSF DCE dialect of IDL (including the various extensions introduced by the Microsoft IDL compiler) and the OMG IIOP/CORBA dialect. '7 KB (1,100 words) - 06:49, 8 June 2023
- :Yarrow is a proof-assistant for Pure Type Systems (PTSs) with several extensions. In Yarrow you can experiment with various pure type systems, representing6 KB (926 words) - 12:12, 16 January 2022
- ...per, but is it really necessary to have 'order by' or 'group by' as syntax extensions? Isn't it possible to allow developers to use any function as long it matc11 KB (1,836 words) - 02:36, 25 September 2007
- ...-platform, ghc-7.0.3 to ghc-7.6.x. It also demonstrates how to enable some extensions.9 KB (1,261 words) - 15:40, 22 December 2017
- extensions.10 KB (1,441 words) - 14:03, 17 December 2012
- ''Syntactic extensions make source code processors complicated and error prone. But they don't hel .../<hask>compose2</hask>. However it does not satisfyingly help to implement extensions of <hask>*By</hask> functions, because the key for sorting/grouping/maximis24 KB (4,110 words) - 01:13, 7 November 2020
- First, we will include all the required GHC extensions and import libraries: ...://ocharles.org.uk/blog/posts/2014-12-12-type-families.html 24 Days of GHC Extensions: Type Families]28 KB (3,716 words) - 13:01, 20 October 2017
- RULES are now always parsed and checked. No ghc flags or language extensions are required. (Note: the first 6.10 RC had a bug in this area)11 KB (1,737 words) - 18:00, 13 March 2011
- ...odule <hask>Data.Functor.Compose</hask>. The first one needs a lot of type extensions, whereas the second one is entirely Haskell 98.8 KB (1,326 words) - 08:20, 31 March 2022
- # To provide a simple testbed for STG extensions. One of the goals of Ministg is to provide a simple testbed for extensions to the STG machine. One such extension is call-stack tracing. The idea is t15 KB (2,396 words) - 07:19, 10 August 2022
- is at least POSIX-compliant and supports some GNU extensions) to K14 KB (2,142 words) - 16:03, 10 June 2012
- No language extensions are required and the scheme is immediately usable. ...and the mailing list provided important enlightenment, especially that no extensions to the language would be required.27 KB (4,434 words) - 20:29, 19 February 2015
- Some new extensions and developers.10 KB (1,387 words) - 13:11, 17 December 2012
- ...[[Prelude_extensions#Matrices|simple matrix implementation]] in [[Prelude extensions]],8 KB (1,150 words) - 15:41, 5 July 2022
- :<i>Details: [http://haskell.org/ghc/docs/latest/html/users_guide/type-class-extensions.html#instance-overlap GHC User's Guide]</i> == Type class system extensions ==30 KB (4,685 words) - 01:34, 14 July 2021
- ...monad-exception}} (reduces the number of type class instances by some type extensions)10 KB (1,404 words) - 06:22, 22 January 2020
- [[Category:Language extensions]]8 KB (1,374 words) - 14:33, 15 December 2022
- ...e best performance are non-portable, perhaps because they require language extensions that aren't implemented in all compilers (e.g. unboxing), or because they r10 KB (1,392 words) - 21:39, 26 August 2018
- ...can be an arbitrary Haskell expression that does not require any language extensions to be parsed. The expression itself is not evaluated at compile time but ra9 KB (1,381 words) - 22:32, 29 June 2021