akeep

nanopass-framework

Scheme2015–2016

akeep / nanopass-framework · Archived

nanopass-framework

The new nanopass framework; an embedded DSL for writing compilers in Scheme

Languages & Compilers Productivity Hardware & Embedded

Explore on GitHub Read Hacker News discussions

3Distinct people

4Mentions

0Explicit recommenders

324GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

The new nanopass framework; an embedded DSL for writing compilers in Scheme

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:03:16 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by month4 dated mentions

Observed mentions: 2015-08-17 14:26:34 UTC to 2016-12-18 21:23:58 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
Aug 2015	2015-08-01 00:00:00 UTC	2015-09-01 00:00:00 UTC	1	1
Sep 2015	2015-09-01 00:00:00 UTC	2015-10-01 00:00:00 UTC	0	0
Oct 2015	2015-10-01 00:00:00 UTC	2015-11-01 00:00:00 UTC	0	0
Nov 2015	2015-11-01 00:00:00 UTC	2015-12-01 00:00:00 UTC	0	0
Dec 2015	2015-12-01 00:00:00 UTC	2016-01-01 00:00:00 UTC	0	0
Jan 2016	2016-01-01 00:00:00 UTC	2016-02-01 00:00:00 UTC	0	0
Feb 2016	2016-02-01 00:00:00 UTC	2016-03-01 00:00:00 UTC	0	0
Mar 2016	2016-03-01 00:00:00 UTC	2016-04-01 00:00:00 UTC	1	1
Apr 2016	2016-04-01 00:00:00 UTC	2016-05-01 00:00:00 UTC	0	0
May 2016	2016-05-01 00:00:00 UTC	2016-06-01 00:00:00 UTC	1	1
Jun 2016	2016-06-01 00:00:00 UTC	2016-07-01 00:00:00 UTC	0	0
Jul 2016	2016-07-01 00:00:00 UTC	2016-08-01 00:00:00 UTC	0	0
Aug 2016	2016-08-01 00:00:00 UTC	2016-09-01 00:00:00 UTC	0	0
Sep 2016	2016-09-01 00:00:00 UTC	2016-10-01 00:00:00 UTC	0	0
Oct 2016	2016-10-01 00:00:00 UTC	2016-11-01 00:00:00 UTC	0	0
Nov 2016	2016-11-01 00:00:00 UTC	2016-12-01 00:00:00 UTC	0	0
Dec 2016	2016-12-01 00:00:00 UTC	2017-01-01 00:00:00 UTC	1	1

What Hacker News says

4 sources

616c·Dec 18, 2016

Is this preceding work to the tour de force that is the Chez Scheme incremental like 40+ Scheme compiler. I mean, Cisco bought it, probably to hide it from us all. It must be worth something. https://www.youtube.com/watch?v=Os7FE3J-U5Q http://lambda-the-ultimate.org/node/1589 https://github.com/akeep/nanopass-framework

In An Incremental Approach to Compiler Construction (2006) [pdf]

sklogic·May 16, 2016

I did it many times elsewhere in this thread already. For example, this one: http://www.moserware.com/2008/04/towards-moores-law-software... Or Nanopass itself, not just as a tool for building DSLs, but as an example of a nice and clean DSL (of course, if it could bootstrap itself it would have been even better): https://github.com/akeep/nanopass-framework Or everything you can find in my github repositories (username: combinatorylogic).

In Whoever does not understand Lisp is doomed to reinvent it (2007)

fizixer·Mar 31, 2016

Really great work. Thumbs up. As an experienced programmer who only recently got into compilers, I have a few, open ended, somewhat advanced, questions about the transformer phase (for anyone to comment, thanks in advance). It appears to me that the transformer is like the guts of the compiler, everything else is more like support system. And more often than not, the purpose of transformation ends up being 'optimization', but of course you could do transformation for other purposes. However this phase ends up being very hairy logic if the programmer is not careful. Anyway, my questions are: - is there any consensus on creating a DSL for providing transformation rules instead of hand coding them in the programming language? - There is the nanopass compiler framework in scheme [0]. Is that one of the superior ways of doing things? or are th

Read the rest

ere any serious criticisms about that technique? - Is there a relationship between compiler transformations and 'term-rewriting systems'? - OMeta/OMeta2 pattern matching on context-free-languages? Whether it's nanopass-framework, OMeta2, term-rewriting system, or some other DSL, I guess what I'm trying to get at is how can that phase be made more 'formal', so I guess at this point we get into the area of 'formal systems' and 'formal semantics' etc, etc. I would appreciate if there is recommended reading (books, survey papers, etc) on this topic. [0] https://github.com/akeep/nanopass-framework

In Super Tiny Compiler

sklogic·Aug 17, 2015

Any language that allows compile-time metaprogramming (and not as restricted as TH) should allow to implement all the components I want. One example of such a system is the Nanopass framework [1], used alongside with cKanren [2]. Another example is my own system [3]. [1] https://github.com/akeep/nanopass-framework http://www.cs.indiana.edu/~dyb/pubs/nano-jfp.pdf [2] http://scheme2011.ucombinator.org/papers/Alvis2011.pdf [3] https://github.com/combinatorylogic/mbase

In State of the Haskell ecosystem