Framework for Self-referential data structures: ConsList and ConsTree
Framework for Self-referential data structures: ConsList and ConsTree
[Athina Kyriazi]
[University of Patras]
[Abstract: Is it possible to operate in Self-Referential Expressions? For which of those is it worth making framework? ConsList and ConsTree are two self referential types that are being introduced in this community post. It includes new function definitions (ex. constructors) and properly modified functions from the List and the Tree Framework in order to be able to operate on these types.]
Initialization
Initialization
Introduction
Introduction
Is it possible to operate on Self-Referential Expressions?
Is it possible to operate on Self-Referential Expressions?
Are there any MEANINGFUL Self-Referential Expressions?
Are there any MEANINGFUL Self-Referential Expressions?
List and ConsList
List and ConsList
Tree and ConsTree
Tree and ConsTree
ConsList
ConsList
Construction
Construction
Manipulation
Manipulation
Application Examples
Application Examples
ConsTree
ConsTree
Construction
Construction
Manipulation
Manipulation
Application Example
Application Example
Conclusion
Conclusion
List problems - What ConsList offers?
List problems - What ConsList offers?
Why self-reference instead of Iteration?
Why self-reference instead of Iteration?
Possible model extensions
Possible model extensions
Keywords
Keywords
◼
infinite list
◼
infinite tree
◼
Hold / Evaluate
◼
Self reference / Recursion
Acknowledgment
Acknowledgment
This project wouldn’t be possible without the help of my mentors Christopher Wolfram and Bradley Klee. Sotiris Michos contributed as well. Special thanks also to Dr. Stephen Wolfram for assigning me this project. The other great part of this experience was having lots of peers to work with and a fun team for project meetings.
References
References