Total Modal: A category of rewrite rules that must...

Devine Lu Linvega's posts Post Back to profile

Total Modal: A category of rewrite rules that must always have more terms in the left-hand side, than on the right-hand side. When found to be the only type of rules in a program, it makes up for a non-turing complete program that will always terminate. For example, where "swap" is the fuel:

<> (swap ?x ?y) (?y ?x)

Like 16 May at 15:34 | Open on merveilles.town

5 comments

mvu

@neauoire It is my goal in life to one day understand your posts about Modal~

16 May at 15:48 | Open on peoplemaking.games

Devine Lu Linvega

@mvu I'd love to help if somethings aren't clear : )

16 May at 16:13 | Open on merveilles.town

DELETED

@neauoire wow, what an intuitive proof of termination. am I understanding correctly that the number of terms strictly decreases?

16 May at 18:25 | Open on catlang.social

Devine Lu Linvega

@isagel yeah, in the case where a rewrite rule takes more terms than it writes, it's part of the terminating category :)

16 May at 22:11 | Open on merveilles.town

DELETED

this isn't super clear to me! it seems like balancing on the boundary of completeness. it seems like this argument is pretty well tied to the evaluation of modal, no?

if you have more thoughts about how this fits into the chomsky hierarchy, i'd love to hear about it, but this is plenty of motivation for me to play with modal :>

17 May at 19:04 | Open on catlang.social

Go Up