Logical Reasoning for Higher-Order Functions with Local State

Details Logical Reasoning for Higher-Order Functions with Local State Logical Reasoning for Higher-Order Functions with Local State

2008-06-15

arxiv.org/abs/0806.2448v2

LMCS 4 (4:2) 2008

Computer Science

Logic in Computer Science

68 pages

Scientific paper

10.2168/LMCS-4(4:2)2008

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.

Affiliated with

Also associated with

No associations

Rating

Logical Reasoning for Higher-Order Functions with Local State does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logical Reasoning for Higher-Order Functions with Local State, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logical Reasoning for Higher-Order Functions with Local State will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258487