Termination in impure concurrent languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6269 LNCS, Issue , 2010, Pages 328-342

  Demangeon, Romain ^a   Hirschkoff, Daniel ^a   Sangiorgi, Davide ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT LANGUAGES; FUNCTIONAL LANGUAGES; FUNCTIONAL PARTS; LOGICAL RELATIONS; SEQUENTIAL LANGUAGES; TERM REWRITING;

BIOMINERALIZATION; COMBINES;

CALCULATIONS;

EID: 78249288769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_23     Document Type: Conference Paper

References (13)

1. Amadio, R.: On Stratified Regions. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 210-225. Springer, Heidelberg (2009)
2. Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 24-39. Springer, Heidelberg (2004)
3. Boudol, G.: Fair Cooperative Multithreading. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 272-286. Springer, Heidelberg (2007)
4. Demangeon, R., Hirschkoff, D., Kobayashi, N., Sangiorgi, D.: On the Complexity of Termination Inference for Processes. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol. 4912, pp. 140-155. Springer, Heidelberg (2008)
5. Demangeon, R., Hirschkoff, D., Sangiorgi, D.: Appendix to this paper, proofs (2010), http://www.cs.unibo.it/~sangio/
6. Demangeon, R., Hirschkoff, D., Sangiorgi, D.: A Method for Termination in a λ-calculus with References (2010), http://www.cs.unibo.it/~sangio/
7. Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. Information and Computation 204(7), 1045-1082 (2006)
8. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1988)
9. Pierce, B.C., Turner, D.N.: Pict: a programming language based on the pi-calculus. In: Proof, Language, and Interaction, pp. 455-494. The MIT Press, Cambridge (2000)
10. Sangiorgi, D.: Termination of Processes. Math. Structures in Comput. Sci. 16(1), 1-39 (2006)
11. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
12. Turner, N.D.: The polymorphic pi-calculus: Theory and Implementation. PhD thesis, Department of Computer Science, University of Edinburgh (1996)
13. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the Pi- Calculus. Information and Computation 191(2), 145-202 (2004)