Referential transparency, definiteness and unfoldability

DOI10.1007/BF00277387MaRDI QIDQ1823006zbMATH OpenOpenAlexWikidataFDO

Authors Harald Søndergaard, Peter Sestoft

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)

Recommendations

• Nondeterminism with Referential Transparency in Functional Programming Languages
• What is a purely functional language?
• Notions of computation and monads
• Applicative caching
• Definitional interpreters for higher-order programming languages

Cited in

(8)

• Computing in unpredictable environments: semantics, reduction strategies, and program transformations
• Semantics of under-determined expressions
• Trends in trends in functional programming 1999/2000 versus 2007/2008
• Hash consed points-to sets
• Composition, indiscernibility, coreferentiality
• Distributed random number generation
• scientific article; zbMATH DE number 5029987 (Why is no real title available?)
• Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

This page was built for publication: Referential transparency, definiteness and unfoldability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823006)