A calculus for assignments in higher-order languages

Authors:
Mattias Felleisen;D. P. Friedman
Affiliations:
Computer Science Department, Indiana University, Lindley Hall 101, Bloomington, IN, USA;Computer Science Department, Indiana University, Lindley Hall 101, Bloomington, IN, USA
Venue:
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1987

Citing 5
Cited 15

Standard, storeless semantics for ALGOL-style block structure and call-by-name

Proceedings of the international conference on Mathematical foundations of programming semantics
A fully abstract semantics and a proof system for an ALGOL-like language with sharing

Proceedings of the international conference on Mathematical foundations of programming semantics
Protection in programming languages

Communications of the ACM
Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM
The semantics of local storage, or what makes the free-list free?(Preliminary Report)

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Polymorphic effect systems

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Call by name, assignment, and the lambda calculus

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A provable time and space efficient implementation of NESL

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Monadic state: axiomatization and type safety

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
A provably time-efficient parallel implementation of full speculation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Revised report on the algorithmic language scheme

ACM SIGPLAN Lisp Pointers
The semantics of future and an application

Journal of Functional Programming
Dynamic state restoration using versioning exceptions

Higher-Order and Symbolic Computation
Readings in scheme

ACM SIGPLAN Lisp Pointers
The Higher-Order Aggregate Update Problem

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Extending the loop language with higher-order procedural variables

ACM Transactions on Computational Logic (TOCL)
Abstracting abstract machines

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Temporal higher-order contracts

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Introspective pushdown analysis of higher-order programs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Sound and precise malware analysis for android via pushdown reachability and entry-point saturation

Proceedings of the Third ACM workshop on Security and privacy in smartphones & mobile devices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Imperative assignments are abstractions of recurring programming patterns in purely functional programming languages. When added to higher-order functional languages, they provide a higher-level of modularity and security but invalidate the simple substitution semantics. We show that, given an operational interpretation of a denotational semantics for such a language, it is possible to design a two-level extension of the &lgr;u-calculus. This calculus provides a location-free rewriting semantics of the language and offers new possibilities for reasoning with assignments. The upper level of the calculus factors out all the steps in a reduction sequence which must be in a linear order; the lower level allows a partial ordering of reduction steps.