Assignment calculus: a pure imperative language

DOI10.1007/978-3-642-35722-0_4MaRDI QIDQ3455835zbMATH OpenOpenAlexWikidataFDO

Authors Marc Bender, Jeffery Zucker

Publication date 11 December 2015

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35722-0_4

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• An imperative pure calculus
• A logical view of assignments
• Publication:4490727
• About classical logic and imperative programming
• A syntactic theory of sequential state

Cites work

• A completeness theorem in modal logic
• A formulation of the simple theory of types
• Can programming be liberated from the von Neumann style?
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3151566 (Why is no real title available?)
• The revised report on the syntactic theories of sequential control and state
• Universal grammar

Cited in

(5)

• Aliasing Control in an Imperative Pure Calculus
• scientific article; zbMATH DE number 1479615 (Why is no real title available?)
• A logical view of assignments
• A graph model for imperative computation
• An imperative pure calculus

This page was built for publication: Assignment calculus: a pure imperative language

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