Recursive Data Types in Setl: Automatic Determination, Data Language Description, and Efficient Implementation (Classic Reprint) - Hardcover

Gerald Weiss

9780265439371: Recursive Data Types in Setl: Automatic Determination, Data Language Description, and Efficient Implementation (Classic Reprint)

Hardcover

ISBN 10: 026543937X ISBN 13: 9780265439371

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

0 Used

2 New

From US$ 34.74

Unlocking the structure of recursive data in SETL and how to use it for efficient code

This book examines how to detect and type recursive objects in SETL, and how that insight can drive faster, more reliable code. It explains the type model behind SETL and the role of a data representation sublanguage in binding types to variables and choosing internal representations. The work covers theoretical foundations, practical extensions to the language, and methods for applying typefinding to real programs.

The text presents a clear view of why recursive data types matter in high‑level languages and how persistent type information can improve performance and storage management. It also compares different programming paradigms and shows how SETL’s features support complex, nested structures without sacrificing safety or efficiency. Reader-friendly discussions include how the typefinder handles trees and other recursive forms, and how basings and representations help tailor data layouts.

How recursive structures are defined, detected, and typed within SETL
Ways the representation sublanguage optimizes storage and in-line code generation
Concepts like basings, maps, sets, and tuples in the context of recursion
Practical implications for compiler design and run‑time performance

Ideal for readers curious about language design, type systems, and SETL’s approach to dynamic, nested data.

"synopsis" may belong to another edition of this title.