메뉴 건너뛰기




Volumn 1466, Issue , 1998, Pages 115-130

From higher-order π-calculus to π-calculus in the presence of static operators

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

EID: 84945952027     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055619     Document Type: Conference Paper
Times cited : (10)

References (9)
  • 1
    • 0029229420 scopus 로고
    • Bisimulation can’t be traced
    • January
    • Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232-268, January 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.1 , pp. 232-268
    • Bloom, B.1    Istrail, S.2    Meyer, A.R.3
  • 2
    • 0031601027 scopus 로고    scopus 로고
    • Proving trust in systems of second-order processes
    • Available electronically at
    • M. Dam. Proving trust in systems of second-order processes. In Proc. HICSS’31 IEEE Comp. Soc., VII:255-264, 1998. Available electronically at ftp://ftp.sics.se/pub/fdt/mfd/ptssop.ps.Z.
    • (1998) Proc. HICSS’31 IEEE Comp. Soc. , vol.7 , pp. 255-264
    • Dam, M.1
  • 6
    • 4243280848 scopus 로고    scopus 로고
    • Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics
    • Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. pages 179-194. Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics, 1997.
    • (1997) Decoding choice encodings , pp. 179-194
    • Nestmann, U.1    Pierce, B.C.2


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