Qilang Google Group

test-reader.qi

stefan.ta...@spray.se (snorgers) — Thu, 11 Nov 2009 23:16:45 UT

I've now been running same tests and made a couple of examples where
the focus have been in the Yacc part and the segment part of the code
as well as a General Streaming method.

as an example I did a parser for a toy lang. and then created a
modified list stream that
added the capabilities to let the line column and depth be kept in

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Wed, 11 Nov 2009 22:28:13 UT

This is actually an interesting question (maybe I'm missing the point
but oh well)

consider
def f (u [(m X) Y]) Cont -> ...

now if the input to the function is unbound it will be bound to [X Y]
but this is not enough.
you should bind it to (u [(m X) Y]) and then in the unifications done

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Sun, 11 Nov 2009 23:56:44 UT

Here is generated lisp for "member"

(DEFUN member (V1466 V1467 V1468)
(LABELS ((g285 ()
(LET ((X1430 (lookup V1467)))
(IF (CONSP X1430)
(LABELS ((g287 ()
(IF
(EQ (PROGN (newframe) (unify V1466 (CAR

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Sun, 11 Nov 2009 23:21:13 UT

Hi Mark,

Good to see you back and great questions

i) I decided to manage the stack explicitly with a simple array,

ii) I decided to see the impact of an array of cons cells and
allocations of cons cells for
many operations that is done from this stack hence there is a lot
less consing going on

Re: einstein riddle

dr.mtar...@ukonline.co.uk (Mark Tarver) — Sun, 11 Nov 2009 17:35:50 UT

Just dropped in; looked at the code for Shen. Interesting; some
questions to reflect on though.

1. The 10X speedup sounds great but some details would be good. How
is the speedup gained? What does the generated Lisp code look like?

2. What is the declarative meaning of u? I guess it means 'unifies'.

Re: einstein riddle

st...@keptprivate.com (stever) — Thu, 10 Oct 2009 01:12:58 UT

Thanks for the explanation.
I had a different impression from Mark's original Shen proposal.
It really clears up the approach you are taking.
I've got a lot to learn before I will have any insights ;-)

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Tue, 10 Oct 2009 22:42:02 UT

OK, I've replaced define with def in the Lambda.qi file and called it
Lambda.boop.qi
It now can compile itself. The next step is to spend a week writing
tests for it.

The plan is then to start write a typechecker that is turned on all
time that use type driven code
generation to generate target code e.g. lisp and clojure ... it will

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Mon, 10 Oct 2009 21:30:10 UT

The idea is that Shen will be a version of QI that work on "any" lisp
like platform.

The approach is to write a set of core libs in qi and then make a
compilation
to selected platforms like clojure and CL.

The conclusion I draw from that was that the prolog engine in qi had
to be
rewritten. As a consequence the code is

Re: einstein riddle

st...@keptprivate.com (stever) — Mon, 10 Oct 2009 03:17:41 UT

Hi Stefan,

I'm new to Qi and I get the impression that you are porting Qi to
Clojure.
I haven't seen any description of the plans for Shen and was wondering
if you are considering the Clojure work the basis of Shen?

I've been away from Lisp and functional programming for quite a while,
but I really like what Mark has done with Qi. When I get up to speed

Re: einstein riddle

stefan.ta...@spray.se (snorgers) — Fri, 10 Oct 2009 22:08:20 UT

Hi,

The previous result was for manually cleaned lisp code aka proof of
method. Now
after making this cleaning as part of the compilation auto-generated
lisp takes 21ms
to solve the Einstein riddle. In the process code has been tested and
bugs squashed.

I also prepared the code in a state so that it can experimented with

Re: einstein riddle

rao...@gmail.com (Raoul Duke) — Sun, 10 Oct 2009 21:00:35 UT

that is pretty exciting news! congratulations :)
sincerely.

einstein riddle

stefan.ta...@spray.se (snorgers) — Sat, 10 Oct 2009 21:27:54 UT

Hi,

I've been busy coding for some time. I now have a working basic
framework. This framework can be used to combine backtracking and
unifications to builed prolog like features. E.g. in my view a natural
building block to spark Shen from.

The last couple of week's I've been focusing in understanding how to

Qi on Clozure CL

nitral...@googlemail.com (Nik) — Fri, 10 Oct 2009 10:08:49 UT

Hi folks,

Does somebody work on porting Qi to Clozure CL?

Regards
Nik

Re: Need more eyes on two small Qi-YACC parsers

stefan.ta...@spray.se (snorgers) — Thu, 09 Sep 2009 18:53:16 UT

You should now that the symbols in qi follows the rules of comon-lisp
that
qi package.

You need to work at the character stream level and or work with
strings

/Stefan

Re: Need more eyes on two small Qi-YACC parsers

danieljom...@gmail.com (Daniel Jomphe) — Thu, 09 Sep 2009 00:39:55 UT

Thinking of it, I don't even need ::= to be parsed as ::=. My real
intention is to translate stuff. But I'm still confounded by this side-
effect of something I'm not aware of.

From this below, I see that a colon (:) seems to somehow quote what
follows. But I'm really not sure about this. I suppose I'll have to