Syntactic control of concurrency
We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained wi...
मुख्य लेखकों: | Ghica, D, Murawski, A, Ong, L |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
Elsevier
2006
|
विषय: |
समान संसाधन
-
Angelic semantics of fine-grained concurrency
द्वारा: Ghica, D, और अन्य
प्रकाशित: (2008) -
Games for complexity of second-order call-by-name programs
द्वारा: Murawski, A
प्रकाशित: (2005) -
Functions with local state: regularity and undecidability
द्वारा: Murawski, A
प्रकाशित: (2005) -
Third-order Idealized Algol with iteration is decidable
द्वारा: Murawski, A, और अन्य
प्रकाशित: (2008) -
Method of defining syntactic metalanguage
द्वारा: 8096 British Standards Institution