This repository was archived by the owner on Dec 9, 2025. It is now read-only.
Replace the semi compressed trees by a term stack construction#18
Open
Replace the semi compressed trees by a term stack construction#18
Conversation
mlaveaux
changed the title
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
The advantage would be that a tree contains a lot of pointer indirections, namely stored as pointers to children, whereas the stack is simply a contiguous vector. Currently, it is less efficient because the semi compressed trees stores closed terms compressed, i.e. as a single node, which the term stack does not yet do. Furthermore, the evaluation is rather naive and could be replaced by a dedicated procedure. Both should be implemented before merging the pull request.