summaryrefslogtreecommitdiffstats
path: root/content/zettel/3c3g.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/3c3g.md')
-rw-r--r--content/zettel/3c3g.md25
1 files changed, 25 insertions, 0 deletions
diff --git a/content/zettel/3c3g.md b/content/zettel/3c3g.md
new file mode 100644
index 0000000..00c2775
--- /dev/null
+++ b/content/zettel/3c3g.md
@@ -0,0 +1,25 @@
++++
+title = "Defining the abstract language for symbolic evaluation"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["3c3f"]
+forwardlinks = ["1b8", "3c3h", "3c3g1"]
+zettelid = "3c3g"
++++
+
+To perform symbolic evaluation, we need to define a language that will
+syntactically produce equivalent programs if translated from RTLBlock or
+RTLPar if the schedule is correct. The language is represented as a
+tree, where each register maps to it's symbolic representation, that
+being the entry register by default. The difficulty comes because of the
+introduction of predicates because of the use of hyperblocks ([\#1b8]).
+
+The main idea of this abstract language is that the symbolic expressions
+that are assigned to each of the registers needs to be self-contained,
+and contain the full expression that will be assigned to the register.
+Especially with symbolic instructions, one therefore have to make the
+decision whether to have recursive predicated expressions, or linear
+predicated expressions.
+
+ [\#1b8]: /zettel/1b8