scalogno

Scalogno as presented in APLAS'19 (PDF).

• 2.1 Relations as Functions

• 2.1 edge example

• 2.1 path def example

• 2.1 path example

• 2.2 Higher-Order Relations as Higher-Order Functions

• 2.2 reflexive transitive closure

• 2.3 Object-Oriented Encapsulation

• 2.3 example

• 3.1 Designing Logic Engines for Meta-Programming (Fig 1)

• 3.3 path rule def example

• 3.3 path example

• 3.4 Clause Reification as Controlled Side Effect

• 4 fib example

• 4.2 Memoization with Symbolic State Transitions

• 4.3 Example: Tabled Graph Evaluation

• 4.3 example

• 4.4 Definite Clause Grammar (DFG)

• 4.4 example

Beyond APLAS:

• the all branch adds an SMT solver as a backend, and combines it with tabling too. Work remains to refactor the combination into composable modules, and ... find a killer app beyond shortest paths. :)