Equivalence in functional languages with effects

Functional equivalence
DOI: 10.1017/s0956796800000125 Publication Date: 2008-11-07T16:14:35Z
ABSTRACT
Abstract Traditionally the view has been that direct expression of control and store mechanisms clear mathematical semantics are incompatible requirements. This paper shows adding objects with memory to call-by-value lambda calculus results in a language rich equational theory, satisfying many usual laws. Combined other recent work, this provides evidence expressive, mathematically clean programming languages indeed possible.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (43)
CITATIONS (100)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....