Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Bunched logic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Interference control === In perhaps the first use of substructural type theory to control resources, [[John C. Reynolds]] showed how to use an [[Affine logic|affine]] type theory to control aliasing and other forms of interference in [[Algol]]-like programming languages.<ref>{{cite book|last1=Reynolds|first1=John|title=Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 |chapter=Syntactic control of interference |pages=39β46|doi=10.1145/512760.512766|year=1978|isbn=9781450373487|s2cid=18716926|doi-access=free}}</ref> O'Hearn used bunched type theory to extend Reynolds' system by allowing interference and non-interference to be more flexibly mixed.<ref name = "OHearn02" /> This resolved open problems concerning recursion and jumps in Reynolds' system.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)