메뉴 건너뛰기




Volumn , Issue , 2010, Pages 209-218

A generic operational metatheory for algebraic effects

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; MACHINERY; SEMANTICS; SYNTACTICS;

EID: 78449290995     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.29     Document Type: Conference Paper
Times cited : (58)

References (23)
  • 1
    • 84974295344 scopus 로고
    • Equivalence in functional languages with effects
    • I. Mason and C. Talcott, "Equivalence in functional languages with effects," Journal of Functional Programming, vol. 1, pp. 287-327, 1991.
    • (1991) Journal of Functional Programming , vol.1 , pp. 287-327
    • Mason, I.1    Talcott, C.2
  • 4
    • 0000230630 scopus 로고
    • LCF considered as a programming language
    • G. Plotkin, "LCF considered as a programming language," Theoretical Computer Science, vol. 5, pp. 223-255, 1977.
    • (1977) Theoretical Computer Science , vol.5 , pp. 223-255
    • Plotkin, G.1
  • 5
    • 2942572885 scopus 로고    scopus 로고
    • A structural approach to operational semantics
    • -, "A structural approach to operational semantics," Journal of Logic and Algebraic Programming, vol. 60-61, pp. 17-139, 2004.
    • (2004) Journal of Logic and Algebraic Programming , vol.60-61 , pp. 17-139
    • Plotkin, G.1
  • 11
    • 0001233777 scopus 로고    scopus 로고
    • Parametric polymorphism and operational equivalence
    • A. Pitts, "Parametric polymorphism and operational equivalence," Mathematical Structures in Computer Science, vol. 10, pp. 321-359, 2000.
    • (2000) Mathematical Structures in Computer Science , vol.10 , pp. 321-359
    • Pitts, A.1
  • 13
    • 0001862336 scopus 로고
    • Fully abstract models of typed λ-calculi
    • R. Milner, "Fully abstract models of typed λ-calculi," Theoretical Computer Science, vol. 4, pp. 1-22, 1977.
    • (1977) Theoretical Computer Science , vol.4 , pp. 1-22
    • Milner, R.1
  • 15
  • 16
    • 35748935522 scopus 로고    scopus 로고
    • Selective strictness and parametricity in structural operational semantics, inequationally
    • J. Voigtländer and P. Johann, "Selective strictness and parametricity in structural operational semantics, inequationally," Theoretical Computer Science, vol. 388, pp. 290-318, 2007.
    • (2007) Theoretical Computer Science , vol.388 , pp. 290-318
    • Voigtländer, J.1    Johann, P.2
  • 17
    • 70350267543 scopus 로고    scopus 로고
    • A family of syntactic logical relations for the semantics of Haskell-like languages
    • P. Johann and J. Voigtländer, "A family of syntactic logical relations for the semantics of Haskell-like languages," Information and Computation, vol. 207, pp. 341-368, 2009.
    • (2009) Information and Computation , vol.207 , pp. 341-368
    • Johann, P.1    Voigtländer, J.2
  • 20
    • 0037028904 scopus 로고    scopus 로고
    • From rewrite rules to bisimulation congruences
    • P. Sewell, "From rewrite rules to bisimulation congruences," Theoretical Computer Science, vol. 274, pp. 183-230, 2002.
    • (2002) Theoretical Computer Science , vol.274 , pp. 183-230
    • Sewell, P.1
  • 22
    • 70350365548 scopus 로고    scopus 로고
    • A complete characterization of observational equivalence in polymorphic lambda-calculus with general references
    • E. Sumii, "A complete characterization of observational equivalence in polymorphic lambda-calculus with general references," in Computer Science Logic, Proceedings, 2009, pp. 455-469.
    • Computer Science Logic, Proceedings, 2009 , pp. 455-469
    • Sumii, E.1


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