Advertisement
Published in:
2021 | OriginalPaper | Chapter
16. Expression Trees
Authors : Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
Published in: Introduction to Computation
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Tree-like structures are ubiquitous in Informatics. They are used to provide conceptual models of situations and processes involving hierarchies, for representing the syntax of languages involving nesting, and for representing data in a way that is amenable to processing by recursive algorithms. We have already seen some pictures of trees in Chap. 12, in the explanation of
foldr and foldl, and the sequent calculus proofs in Chap. 14 have a tree-like structure.