This directory contains a number of examples demonstrating the use of TSLang in general and Sifter in particular.
turing_machine/
demonstrates the use ofTSLang
rules to simulate a simple Turing machine.letter_analogy/
shows how to usemapper
to solve a simple letter analogy of the formabc->bcd
,lmn->mno
,def->?
.program_analysis/
shows how to usemapper
to solve a number of different analogy problems involving source code. In particular, it contains the demos discussed in our Onward! 2020 paper.