Equivalence in Functional Languages with Effects

Equivalence in Functional Languages with Effects (1991)

by Ian Mason , Carolyn Talcott

Citations:

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Equivalence in Functional Languages with Effects	user correction - Legacy Corrections
AUTHOR NAME	Ian Mason	SVM HeaderParse 0.1
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
AUTHOR NAME	Carolyn Talcott	SVM HeaderParse 0.1
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
ABSTRACT	Traditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the call-by-value lambda calculus results in a language with a rich equational theory, satisfying many of the usual laws. Combined with other recent work this provides evidence that expressive, mathematically clean programming languages are indeed possible. 1. Overview Real programs have effects---creating new structures, examining and modifying existing structures, altering flow of control, etc. Such facilities are important not only for optimization, but also for communication, clarity, and simplicity in programming. Thus it is important to be able to reason both informally and formally about programs with effects, and not to sweep effects either to the side or under the store parameter rug. Recent work of Talcott, Mason, Felleisen, and Moggi establishes a mathematical foundation for...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	23 found	ParsCit 1.0