메뉴 건너뛰기




Volumn 27, Issue 5, 1998, Pages 1376-1419

A filter model for concurrent λ-calculus

Author keywords

Concurrency; Full abstraction; Functional programming; Nondeterminism; Parallelism; calculus

Indexed keywords


EID: 0000734514     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539794275860     Document Type: Article
Times cited : (49)

References (4)
  • 1
    • 38149144468 scopus 로고
    • A semantics for static type inference in a nondeterministic language
    • M. ABADI, A semantics for static type inference in a nondeterministic language, Inform, and Comput., 109 (1994), pp. 300-306.
    • (1994) Inform, and Comput. , vol.109 , pp. 300-306
    • Abadi, M.1
  • 2
    • 0020981605 scopus 로고
    • On semantic foundations for applicative multiprogramming
    • Springer-Verlag, New York
    • S. ABRAMSKY, On semantic foundations for applicative multiprogramming, in Lecture Notes in Comput. Sci. 154, Springer-Verlag, New York, 1983, pp. 1-14.
    • (1983) Lecture Notes in Comput. Sci. , vol.154 , pp. 1-14
    • Abramsky, S.1
  • 3
    • 0023532827 scopus 로고
    • Observation equivalence as testing equivalence
    • S. ABRAMSKY, Observation equivalence as testing equivalence, Theoret. Comput. Sci., 53 (1987), pp. 225-241.
    • (1987) Theoret. Comput. Sci. , vol.53 , pp. 225-241
    • Abramsky, S.1
  • 4
    • 0002534194 scopus 로고
    • The Lazy Lambda Calculus
    • D. Turner, ed., Addison-Wesley, Reading, MA
    • S. ABRAMSKY, The Lazy Lambda Calculus, Research Topics in Functional Programming, D. Turner, ed., Addison-Wesley, Reading, MA, 1989, pp. 65-116.
    • (1989) Research Topics in Functional Programming , pp. 65-116
    • Abramsky, S.1


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