A classic problem in concurrent programming is known as the “same fringe” problem [1]. What is the same fringe problem? As described by Richard Gabriel [2]: The samefringe problem is this: two binary trees have the same fringe if they have exactly the same leaves reading from left to right. There are many different approaches […]
Reference Pages
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution Erlang evaluation extensibility functional grammar Humus imperative JavaScript Kernel lambda-calculus language message-passing object-oriented pair pattern-matching PEG POLA primitive protocol queue recursion scalability Scheme security sequence serializer starvation state-machine streams synchronization synchronous value vau-calculusPost Calendar
Meta