Static analysis for safe destructive updates in a functional language

DOI10.1007/3-540-45607-4_1MaRDI QIDQ4808804zbMATH OpenFDO

Authors Natarajan Shankar

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2372/23720001.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Experiments with destructive updates in a lazy functional language
• Set constraints for destructive array update optimization
• A uniform treatment of order of evaluation and aggregate update
• scientific article; zbMATH DE number 1118872
• scientific article; zbMATH DE number 2124969

Cited in

(8)

• Static analysis for optimizing reference counting
• Automatic proofs of memory deallocation for a Whiley-to-C compiler
• Verifying Whiley programs with Boogie
• Set constraints for destructive array update optimization
• A Brief Overview of PVS
• The Higher-Order Aggregate Update Problem
• Experiments with destructive updates in a lazy functional language
• A uniform treatment of order of evaluation and aggregate update

Describes a project that uses

Uses Software

• PVS

This page was built for publication: Static analysis for safe destructive updates in a functional language

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