An imperative pure calculus

DOI10.1016/J.ENTCS.2016.03.007zbMATH Open1345.68097OpenAlexW2342367320WikidataQ113317697 ScholiaQ113317697MaRDI QIDQ737089FDOQ737089

Authors: Andrea Capriccioli, Marco Servetto, Elena Zucca 

Publication date: 5 August 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.007

Recommendations

• Aliasing Control in an Imperative Pure Calculus
• Assignment calculus: a pure imperative language
• Functional translation of a calculus of capabilities
• An imperative object calculus
• A logical view of assignments

zbMATH Keywords

aliasingoperational semanticsimperative calculus

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• The revised report on the syntactic theories of sequential control and state
• The call-by-need lambda calculus
• Title not available (Why is that?)
• Semantics engineering with PLT Redex
• A syntactic theory of sequential state
• Skew confluence and the lambda calculus with letrec

Cited In (5)

• Alias calculus for a simple imperative language with decidable pointer arithmetic
• Flexible recovery of uniqueness and immutability
• Assignment calculus: a pure imperative language
• Title not available (Why is that?)
• A logical view of assignments

Uses Software

• PLT Redex
• Featherweight Java

This page was built for publication: An imperative pure calculus

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