Re: Summer of Code Recap

Amirouche writes: >>This would allow us to minimise the amount of code that >>needs to be sent over the network, which is very important to web >>developers. > > You seem concerned by javascript web developers but not about > me in particular. As the maintainer of the only Scheme front

Re: Summer of Code Recap

Héllo, Le 28/08/2017 à 20:56, Ian Price a écrit : 1 Introduction == As many of you are aware, I have been working on compiling Guile Scheme to JavaScript this summer, as part of the Google Summer of Code. This post serves to bookend my work for the year. [...] 2 Project

Re: Summer of Code Recap

Thanks for all the work! I will be the potential user since I need a Scheme way for web front-end and an easy way to integrate it into Artanis. Biwascheme is one of the ways, now we have JS back end for another choice. I expect there're good interfaces to interact with DOMs. I will keep my eyes on

Re: Summer of Code Recap

Thanks again Ian for all your work on this; I've been very proud to be your mentor. Great work, and look forward to seeing this land in Guile proper :)

Summer of Code Recap

1 Introduction == As many of you are aware, I have been working on compiling Guile Scheme to JavaScript this summer, as part of the Google Summer of Code. This post serves to bookend my work for the year. Before I go any further, I have to give my thanks to my mentor [Chris

Re: problems with syntax-case and with-syntax

On Sun, 27 Aug 2017 20:36:53 -0400 Mark H Weaver wrote: > Matt Wette writes: > > > Q1) The code below creates two macros. One called `define-foo' > > which generates a new identifier and then defines that to #t. The > > other, `define-foo/p', generates the same identifier (lexical > > issue?)

Re: Anaphoric macros like when-let

Mark H Weaver writes: > mention that 'when-let' is not actually an anaphoric macro. Anaphoric > macros are those that introduce a binding that is not named by the > user, e.g. 'it', which is called an anaphor. Yes, you're right, of course! aif, awhen, etc. are the anaphoric macros. I switched t

Re: string-unfold demo

Hello Guilers, Since I find this exercise interesting, I come up with another demo. The trick is to think of string as a list of characters (like in Haskell) and to use the fact that append can be written as an unfold. Let's begin: 1. Use SRFI-1 and SRFI-26 (use-modules (srfi srfi-1)