On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep

WG211/M23Amin: Difference between revisions

From WG 2.11
Jump to navigationJump to search
Nada (talk | contribs)
Created page with "In Odense, I (Nada Amin) presented staged-miniKanren, which augments miniKanren (a relational programming language) with staging constructs. Since then, we (Michael Ballantyne..."
 
Nada (talk | contribs)
No edit summary
 
Line 1: Line 1:
In Odense, I (Nada Amin) presented staged-miniKanren, which augments miniKanren (a relational programming language) with staging constructs. Since then, we (Michael Ballantyne, Raffi Sanna, Will Byrd and Nada Amin) have added support for novel features to account for non-determinism and stage polymorphism. We use staged-miniKanren to stage interpreters written as relations, in which the programs under interpretation are allowed to contain holes representing unknown values. We apply this staging framework to a relational interpreter for a subset of Racket, and demonstrate significant performance gains across multiple synthesis problems.
In [[WG211/M21Amin | Odense]], I (Nada Amin) presented staged-miniKanren, which augments miniKanren (a relational programming language) with staging constructs. Since then, we (Michael Ballantyne, Raffi Sanna, Will Byrd and Nada Amin) have added support for novel features to account for non-determinism and stage polymorphism. We use staged-miniKanren to stage interpreters written as relations, in which the programs under interpretation are allowed to contain holes representing unknown values. We apply this staging framework to a relational interpreter for a subset of Racket, and demonstrate significant performance gains across multiple synthesis problems.

Latest revision as of 01:55, 11 March 2024

In Odense, I (Nada Amin) presented staged-miniKanren, which augments miniKanren (a relational programming language) with staging constructs. Since then, we (Michael Ballantyne, Raffi Sanna, Will Byrd and Nada Amin) have added support for novel features to account for non-determinism and stage polymorphism. We use staged-miniKanren to stage interpreters written as relations, in which the programs under interpretation are allowed to contain holes representing unknown values. We apply this staging framework to a relational interpreter for a subset of Racket, and demonstrate significant performance gains across multiple synthesis problems.