메뉴 건너뛰기




Volumn 2380 LNCS, Issue , 2002, Pages 572-584

A total approach to partial algebraic specification

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MAPPING; SPECIFICATIONS;

EID: 84869151660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_49     Document Type: Conference Paper
Times cited : (8)

References (20)
  • 3
    • 0020293079 scopus 로고
    • Partial abstract types
    • M. Broy and M. Wirsing. Partial abstract types. Acta Informatica, 18:47-64, 1982.
    • (1982) Acta Informatica , vol.18 , pp. 47-64
    • Broy, M.1    Wirsing, M.2
  • 4
    • 0031069158 scopus 로고    scopus 로고
    • May i borrow your logic? (Transporting logical structures along maps)
    • M. Cerioli and J. Meseguer. May I borrow your logic? (Transporting logical structures along maps). Theoretical Computer Science, 173(2):311-347, 1997.
    • (1997) Theoretical Computer Science , vol.173 , Issue.2 , pp. 311-347
    • Cerioli, M.1    Meseguer, J.2
  • 10
    • 0027116146 scopus 로고
    • Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
    • J. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217-273, 1992.
    • (1992) Theoretical Computer Science , vol.105 , Issue.2 , pp. 217-273
    • Goguen, J.1    Meseguer, J.2
  • 12
    • 0032040286 scopus 로고    scopus 로고
    • Dynamically-typed computations for order-sorted equational presentations
    • April
    • C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-typed computations for order-sorted equational presentations. Journal ofSymb olic Computation, 25(4):455-526, April 1998.
    • (1998) Journal OfSymb Olic Computation , vol.25 , Issue.4 , pp. 455-526
    • Hintermeier, C.1    Kirchner, C.2    Kirchner, H.3
  • 13
    • 84973380382 scopus 로고
    • Initial algebraic semantics for non-context-free languages
    • M. Karpinski, editor, volume 56 of LNCS, Springer
    • H. Kaphengst and H. Reichel. Initial algebraic semantics for non-context-free languages. In M. Karpinski, editor, Fundamentals ofComputation Theory, volume 56 of LNCS, pages 120-126. Springer, 1977.
    • (1977) Fundamentals of Computation Theory , pp. 120-126
    • Kaphengst, H.1    Reichel, H.2
  • 15
    • 84957873927 scopus 로고    scopus 로고
    • Membership algebra as a logical framework for equational specification
    • volume 1376 of LNCS
    • J. Meseguer. Membership algebra as a logical framework for equational specification. In Proceedings, WADT'97, volume 1376 of LNCS, pages 18-61, 1998.
    • (1998) Proceedings, WADT'97 , pp. 18-61
    • Meseguer, J.1
  • 17
    • 0005290139 scopus 로고    scopus 로고
    • Equivalences among various logical frameworks of partial algebras
    • volume 1092 of LNCS
    • T. Mossakowski. Equivalences among various logical frameworks of partial algebras. In Computer Science Logic, volume 1092 of LNCS, pages 403-433, 1996.
    • (1996) Computer Science Logic , pp. 403-433
    • Mossakowski, T.1
  • 19
    • 84870474869 scopus 로고    scopus 로고
    • Relating CASL with other specification languages: The institution level
    • To appear
    • T. Mossakowski. Relating CASL with other specification languages: the institution level. Theoretical Computer Science, To appear. www.tzi.de/~{}till.
    • Theoretical Computer Science
    • Mossakowski, T.1


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