메뉴 건너뛰기




Volumn 1139, Issue , 1996, Pages 122-134

Standardization theorem revisited

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL MECHANICS; COMPUTER CIRCUITS; FORMAL LOGIC; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

EID: 84958774193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_8     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 6
    • 0003164539 scopus 로고
    • Computations in orthogonal rewriting systems
    • I. In J.-L. Lassez and G. Plotkin, editors, chapter 11, The MIT Press
    • G. Huet and J.-J. LSvy. Computations in orthogonal rewriting systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson, chapter 11, pages 395-414. The MIT Press, 1991.
    • (1991) Computational Logic, Essays in Honor of Alan Robinson , pp. 395-414
    • Huet, G.1    Lsvy, J.-J.2
  • 8
    • 0001834942 scopus 로고
    • Term rewriting systems
    • S. Abramsky, D. Gabbay, and T. Maibaum, editors, Oxford University Press
    • J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, VoL 2, pages 1-116. Oxford University Press, 1992.
    • (1992) Handbook of Logic in Computer Science , vol.2 , pp. 1-116
    • Klop, J.W.1
  • 10
    • 84969365712 scopus 로고
    • Completeness results for basic narrowing. Applicable Algebra in Engineering
    • A. Middeldorp and E. Itamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:3-21, 1994.
    • (1994) Communication and Computing , vol.5 , pp. 3-21
    • Middeldorp, A.1    Itamoen, E.2


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