require any extensions.
Three extensions seems simple when separate (I think there are many
corner cases)
Cons:
Intervention is required into client code (But I think it is required anyway).
--
Victor Nazarov
___
Glasgow-haskell-users mailing lis
use some very simple Integer implementation. We can
use doubles instead of integers at first to get things rolling.
* in javascript we better use other "unpacking" function for strings,
since Javascript strings doesn't have terminating NUL and have length
built-in.
--
Victor Nazarov
___
On Wed, Aug 3, 2011 at 2:44 PM, Simon Marlow wrote:
> On 03/08/2011 11:09, Victor Nazarov wrote:
>>
>> On Wed, Aug 3, 2011 at 11:30 AM, Simon Peyton-Jones
>> wrote:
>
>>> So perhaps that's the problem. parseDynamicFlags could perfectly well
>>> s
ecific. For instance string literals are desugared into
application of
GHC.unpackCString :: Addr# -> String
to some address wich points to '\0' terminated C-string.
In GHCJS we better provide our own desugaring, then add terminating
'\0' to strings to emula
t possible at all?
>
> Well, GHC generates the stub code in its code generator, doesn't it? If you
> don't call the code generator, because you are using yours instead, then
> it'll be up to you to generate the stub code, no?
I can access ForeignStubs datatype, but I think it already have
generated C-code in it, havn't it? What step during compilation I
should generate stubs on?
--
Victor Nazarov
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
like to create ghcjs and ghcjs-pkg tools that will use their own
directories and package index and will
not interfere with ghc. Is it possible with GHC API? How can I do it?
[1] https://github.com/sviperll/ghcjs
[2]
http://www.haskell.org/haskellwiki/GHC:FAQ#Why_isn.27t_GHC_available_for_.NET_or_on_
Haskell to Javascript translator using GHC API. And I've
ended with the following code to access STG:
https://github.com/sviperll/ghcjs/blob/master/src/Compiler/Main.hs
--
Victor Nazarov
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
I would like to get access to functions exported from Haskell module
and to generate custom stubs for them using GHC API.
As I understand, I need to obtain a list of ForeignDecl's (data
structure defined in HsDecls GHC module) for given source module.
How to achieve this with GHC API?
--
V
load Prelude module which is not
loadable". I don't remember the exact text
and I have no access to my developing-machine. I think it's caused by
circular dependencies between modules.
And I think my compilation script is not quite correct for this case.
What do you think?
--
Vi
Is it possible to generate bindings for worker and wrapper of data
constructor through GHC API? How can I do it?
I want CoreBindings or StgBindings for workers and wrappers for all
data constructors of the module...
--
Victor Nazarov
___
Glasgow
On Fri, Feb 15, 2008 at 2:20 AM, Tim Chevalier <[EMAIL PROTECTED]> wrote:
>
> Well, I got bored in class, so here's a sketch:
> http://lafalafu.com/krc/Scratch/ghc-logo-idea.png
>
> This is still based on Yitzhak's idea of incorporating the Clyde Arc.
> The extra bit of the lambda that extends
On Dec 31, 2007 7:58 PM, Neil Mitchell <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I'm getting errors such as:
>
> C:/Documents/Uni/packages/base/GHC/Base.lhs:270:12:
> Illegal binding of built-in syntax: []
>
> When I try and compile GHC/Base.lhs using the GHC API. Is there some
> flag I can pass to
> STG syntax:
> Foo.zero = NO_CCS Foo.Zero! [];
> SRT(Foo.zero): []
> Foo.one = NO_CCS Foo.Succ! [Foo.Zero];
> SRT(Foo.one): []
> Foo.ten = NO_CCS Foo.Succ! [Foo.one];
> SRT(Foo.ten): []
> Foo.Zero = NO_CCS Foo.Zero! [];
> SRT(Foo.Zero): []
> Foo.Succ = \r
On Nov 19, 2007 9:39 PM, <[EMAIL PROTECTED]> wrote:
> I always - naively - thought that it is a non-problem. How many times have
> I written stuff like that:...
>
> ping = 0 : pong
> pong = 1 : ping
>
> It seems that I don't understand the question of Victor
I use STG-bindings generated by GHC during CoreToSTG phase. What is
the order of this bindings is it random or does it correspond to
original source code or does it reflect the dependency structure of
the program?
If I define the following in my program:
data Numeral = Zero | Succ Numeral
zero =
Is it possible to build Prelude from scratch. Or just some modules
like GHC.Base.
For example when I do
% ghcjs-inplace.bat -fglasgow-exts -fjavascript -cpp -c Err.lhs-boot
% ghcjs-inplace.bat -fglasgow-exts -fjavascript -cpp -c Base.lhs
I've got this error:
Base.lhs:94:0:
Bad interface file
> Is this still up-to-date with the way GHC/GHCi work internally? Then
> I'll certainly check it out.
I think it isn't since STG is pretty much different with the G-machine
describes in the book. The original paper about Spineless Tagless
G-machine is here [1].
It is quite verbose. Recent paper "H
Here is some more details:
% ghc -c -ddump-stg T1.hs
STG syntax:
T1.map =
\u []
let {
map1_sdR =
\r [f_sdN ds_sdI]
case ds_sdI of wild_sdU {
[] -> [] [];
: x_sdM
I have reproduced it on 2 Windows machines with ghc 6.6 and 6.6.1
Here is the version information for ghc used to generate output in
original message.
% ghc -v
Glasgow Haskell Compiler, Version 6.6, for Haskell 98, compiled by GHC
version 6.6
Using package config file: C:\Program Files\Visual Has
On 9/20/07, Simon Peyton-Jones <[EMAIL PROTECTED]> wrote:
>
> | Cool, is it implemented in 2.8? Function tagging seems promising for
> | performance. But it isn't implementable in JavaScript :)
>
> I think it'll be in GHC 6.8.
>
I've meant 6.8 :)
--
vir
http://vir.comtv.ru/
_
What is the purpose for GHC to allocate a thunk for some functions?
Why Test.map is not a function, but updatable thunk, which should
become equal to the function just after the first call? Here is the
details:
> % ghc -c test.hs -ddump-stg
>
> STG syntax:
> Read our paper "Faster laziness using dynamic pointer tagging"! It's new
> (ICFP'07)
> http://research.microsoft.com/~simonpj/papers/ptr-tag/index.htm
>
> simon
>
Cool, is it implemented in 2.8? Function tagging seems promising for
performance. But it isn't implementable in JavaScript :)
I ha
I still have some questions regarding the GHC internals.
There is a description of STG language in the "Making a Fast Curry:
Push/Enter vs. Eval/Apply for Higher-oder Languages" (2004) by Simon
Marlow and Simon Peyton Jones paper. In this description the
constructor application (CONS closure) can o
I still have some questions regarding the GHC internals.
There is a description of STG language in the "Making a Fast Curry:
Push/Enter vs. Eval/Apply for Higher-oder Languages" (2004) by Simon
Marlow and Simon Peyton Jones paper. In this description the
constructor application (CONS closure) can o
Hello.
I'm working on the translation of GHC's STG language to
JavaScript. I've started my implementation, but I've got stuck with
the STG case statements. The problem is the binder in case expression.
StgCase expr livevars liverhsvars bndr srt alttype alts
Operationally, I need to save continuat
25 matches
Mail list logo
