Efficient handling of data structures in definitional languages

DOI10.1016/0167-6423(88)90050-0zbMath0644.68029OpenAlexW1985345781MaRDI QIDQ1102735

Noah S. Prywes, Boleslaw K. Szymanski

Publication date: 1988

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(88)90050-0

zbMATH Keywords

implementationcompilerstorage allocationdefinitional languagesgeneral data structuresincremental structuresnon-recursive iteration computation of Ackermann's functionstorage structures

Mathematics Subject Classification ID

Data structures (68P05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

This page was built for publication: Efficient handling of data structures in definitional languages