메뉴 건너뛰기




Volumn 5904 LNCS, Issue , 2009, Pages 210-225

On stratified regions

Author keywords

Reducibility candidates; Termination; Types and effects

Indexed keywords

INTERACTION MECHANISMS; LAMBDA-CALCULUS; MULTITHREADED; TYPE AND EFFECT SYSTEMS;

EID: 72449131346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10672-9_16     Document Type: Conference Paper
Times cited : (11)

References (12)
  • 1
    • 72449167257 scopus 로고    scopus 로고
    • On stratified regions
    • 0904.2076
    • Amadio, R.: On stratified regions. Report ArXiv:0904.2076
    • Report ArXiv
    • Amadio, R.1
  • 2
    • 72449143443 scopus 로고    scopus 로고
    • Amadio, R, Curien, P.-L, Domains and Lambda Calculi. Cambridge University Press, Cambridge
    • Amadio, R., Curien, P.-L.: Domains and Lambda Calculi. Cambridge University Press, Cambridge
  • 4
    • 38149079697 scopus 로고    scopus 로고
    • Typing termination in a higher-order concurrent imperative language
    • Caires, L, Vasconcelos, V.T, eds, CONCUR 2007, Springer, Heidelberg
    • Boudol, G.: Typing termination in a higher-order concurrent imperative language. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 272-286. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4703 , pp. 272-286
    • Boudol, G.1
  • 5
    • 0026953373 scopus 로고
    • The Esterel synchronous programming language
    • Berry, G., Gonthier, G.: The Esterel synchronous programming language. Science of computer programming 19(2), 87-152 (1992)
    • (1992) Science of computer programming , vol.19 , Issue.2 , pp. 87-152
    • Berry, G.1    Gonthier, G.2
  • 6
    • 84855198112 scopus 로고    scopus 로고
    • Ensuring termination by typability
    • Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Information and Computation 204(7), 1045-1082 (2006)
    • (2006) Information and Computation , vol.204 , Issue.7 , pp. 1045-1082
    • Deng, Y.1    Sangiorgi, D.2
  • 7
    • 0002069980 scopus 로고
    • On Girard's Candidats de Reductibilité
    • Odifreddi ed, Academic Press, London
    • Gallier, J.: On Girard's Candidats de Reductibilité. In: Odifreddi (ed.) Logic and Computer Science, pp. 123-203. Academic Press, London (1990)
    • (1990) Logic and Computer Science , pp. 123-203
    • Gallier, J.1
  • 8
    • 4944243609 scopus 로고
    • A process algebra of timed systems
    • Hennessy, M., Regan, T.: A process algebra of timed systems. Information and Computation 117(2), 221-239 (1995)
    • (1995) Information and Computation , vol.117 , Issue.2 , pp. 221-239
    • Hennessy, M.1    Regan, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.