-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Mon, Feb 27, 2017 at 08:21:03PM +0100, Andy Wingo wrote:
> Hi,
>
> On Mon 27 Feb 2017 11:06, Alejandro Sanchez writes:
>
> > (define v (make #:x 1))
> >
> > (* -1 v) ; Does not work
> > (* -2 v) ; Works fine
>
> I believe that Guile is doing
On Tue 28 Feb 2017 00:00, Thomas Morley writes:
> The main problems/TODOs are listed here (same for guile-2.0.13 and 2.1.7):
> https://ao2.it/tmp/lilypond-guile2/TODO
> With no warranty for completeness.
>
> Let me pick some of them:
> (1)
> lilypond filename_名字.ly
> returns
> fatal error: failed
On Mon 27 Feb 2017 20:21, Andy Wingo writes:
> Hi,
>
> On Mon 27 Feb 2017 11:06, Alejandro Sanchez writes:
>
>> (define v (make #:x 1))
>>
>> (* -1 v) ; Does not work
>> (* -2 v) ; Works fine
>
> I believe that Guile is doing strength reduction, transforming (* -1 v)
> to (- 0 v).
I spoke to
On Tue 28 Feb 2017 09:54, Andy Wingo writes:
> In summary I think Guile's strength reduction is fine as it relies on
> type inference to prove when it is safe. This is "just" a bug, albeit
> an annoying one that we need to fix!
Fixed in 2.0 and master. Thanks for the report :)
Andy
Andy Wingo writes:
> On Tue 28 Feb 2017 00:00, Thomas Morley writes:
>
>> The main problems/TODOs are listed here (same for guile-2.0.13 and 2.1.7):
>> https://ao2.it/tmp/lilypond-guile2/TODO
>> With no warranty for completeness.
>>
>> Let me pick some of them:
>> (1)
>> lilypond filename_名字.ly
Chris Vine writes:
> On Mon, 27 Feb 2017 21:00:54 +0100
> Andy Wingo wrote:
>> Hi,
>>
>> On Thu 26 Jan 2017 09:39, Rchar writes:
>> > https://ecraven.github.io/r7rs-benchmarks/benchmark.html
>> > Is Guile slow or fast, comparing to others?
>>
>> Schemes that compile to native code go faste
On Tue, 28 Feb 2017 11:28:32 +0100
Arne Babenhauserheide wrote:
> Chris Vine writes:
>
> > On Mon, 27 Feb 2017 21:00:54 +0100
> > Andy Wingo wrote:
> >> Hi,
> >>
> >> On Thu 26 Jan 2017 09:39, Rchar writes:
> >> > https://ecraven.github.io/r7rs-benchmarks/benchmark.html
> >> > Is Guile sl
On Tue 28 Feb 2017 10:38, David Kastrup writes:
> Andy Wingo writes:
>> I understand that Lilypond uses the "local-eval" facility a lot for
>> embedded Scheme.
>
> It doesn't use it at all.
Ah, tx for the info (here and below).
> Regular read and eval, however, is used a lot during the parsing
> On 28 Feb 2017, at 10:19, Andy Wingo wrote:
>
> On Tue 28 Feb 2017 09:54, Andy Wingo writes:
>
>> In summary I think Guile's strength reduction is fine as it relies on
>> type inference to prove when it is safe. This is "just" a bug, albeit
>> an annoying one that we need to fix!
>
> Fixed
Le 28/02/2017 à 15:24, Alejandro Sanchez a écrit :
On 28 Feb 2017, at 10:19, Andy Wingo wrote:
On Tue 28 Feb 2017 09:54, Andy Wingo writes:
In summary I think Guile's strength reduction is fine as it relies on
type inference to prove when it is safe. This is "just" a bug, albeit
an annoyi
NYACC version 0.76.5 is released. This release contains more C preprocessor
bug fixes and a C99 pretty-printer bug fix.
NYACC, for Not Yet Another Compiler Compiler!, is set of guile modules for
generating parsers and lexical analyzers. It also provides sample parsers
and pretty-printers using
On Tue, Feb 28, 2017 at 06:53:33PM +0100, Amirouche wrote:
>
>
> Don't forget to ./configure --prefix=/usr.
Unless you run this on a self-compiled syytem that seems like a
very bad idea. You will happily overwrite a distribution provided guile
and during the next system update your package manag
Chris Vine writes:
> No, on my Haswell laptop running 64-bit linux, solving the 40,000th
> prime (479909) is 1.26 times faster in chez scheme than in guile-2.1.7,
> on the simple algorithm. (0.509 seconds versus 0.624 seconds, on a
> i7-4712HQ CPU @ 2.30GHz.) This is only the time taken in the b
13 matches
Mail list logo
