Referential transparency, definiteness and unfoldability

DOI10.1007/BF00277387zbMath0679.68150OpenAlexW1965996801WikidataQ56060833 ScholiaQ56060833MaRDI QIDQ1823006

Peter Sestoft, Harald Søndergaard

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00277387

zbMATH Keywords

definitenessunfoldability

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Hash consed points-to sets, Semantics of under-determined expressions, Trends in trends in functional programming 1999/2000 versus 2007/2008, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Distributed random number generation, Computing in unpredictable environments: Semantics, reduction strategies, and program transformations