Year: 1993
Type: article
Abstract: Many calculi supporting a notion of state have been proposed. However this notion is nearly always based on the intuition of a store, that is a binding from name to values. The exception, monads, recently focused on for I/Os, suffers from its rigidity. The transformation calculus, an extension of lambda calculus, shows another, more general way to do that. It is different from others in that no orthogonal reduction rule is added to fi-reduction, but only structural ones. We introduce here the transformation calculus, and give our approach to its typing. Fundamental properties, like confluence, have been shown, and two type systems, simple and polymorphic, are proposed. 1 Introduction What we call state is a complex notion. It can be as well the external state of a device (like for I/O), the internal value of a variable, which changes during the evaluation, or even, why not, a local value. What makes it a state is fundamentally the way we look at it, the meaning we give to it. The answ...
Source: 数理解析研究所講究録
Author: Jacques Garrigue
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1955776030