π-calculus, Session Types research at Imperial College
We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-like local reference generation. Local references may be generated dynamically and exported outside their scope, may store higher-order functions and may be used to construct complex mutable data structures. This primitive is captured logically using a predicate asserting reachability of a reference name from a possibly higher-order datum and quantifiers over hidden references. We explore the logic’s descriptive and reasoning power with non-trivial programming examples combining higher-order procedures and dynamically generated local state. Axioms for reachability and local invariant play a central role for reasoning about the examples.
@article{YHB2008, author = {Nobuko Yoshida and Kohei Honda and Martin Berger}, title = {{Logical Reasoning for Higher-Order Functions with Local State}}, journal = {CoRR}, volume = {4}, issue = {4}, pages = {68--1}, year = 2008 }
@article{YHB2008, author = {Nobuko Yoshida and Kohei Honda and Martin Berger}, title = {{Logical Reasoning for Higher-Order Functions with Local State}}, journal = {CoRR}, volume = {4}, issue = {4}, pages = {68--1}, doi = "10.2168/LMCS-4(4:2)2008", year = 2008 }