메뉴 건너뛰기




Volumn 2051 LNCS, Issue , 2001, Pages 77-92

Matching power

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); PATHOLOGY; COMPUTATIONAL MECHANICS;

EID: 43449122789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_8     Document Type: Conference Paper
Times cited : (29)

References (39)
  • 2
    • 0028762192 scopus 로고
    • A feature constraint system for logic programming with entailment
    • H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263-283, 1994.
    • (1994) Theoretical Computer Science , vol.122 , Issue.1-2 , pp. 263-283
    • Ait-Kaci, H.1    Podelski, A.2    Smolka, G.3
  • 4
    • 0024130791 scopus 로고
    • Combining algebra and higher-order types
    • V. Breazu-Tannen. Combining algebra and higher-order types. In Proc. of LICS, pages 82-90, 1988.
    • (1988) Proc. of LICS , pp. 82-90
    • Breazu-Tannen, V.1
  • 5
    • 0041805676 scopus 로고
    • Matching - A special case of unification?
    • H.-J. Bürckert. Matching - A special case of unification? Journal of Symbolic Computation, 8(5):523-536, 1989.
    • (1989) Journal of Symbolic Computation , vol.8 , Issue.5 , pp. 523-536
    • Bürckert, H.-J.1
  • 9
    • 0009903219 scopus 로고    scopus 로고
    • The rho cube
    • volume 2030 of LNCS, Springer-Verlag
    • H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. In Proc. of FOSSACS, volume 2030 of LNCS, pages 166-180. Springer-Verlag, 2001.
    • (2001) Proc. of FOSSACS , pp. 166-180
    • Cirstea, H.1    Kirchner, C.2    Liquori, L.3
  • 10
    • 19144364639 scopus 로고    scopus 로고
    • Principles of maude
    • volume 4. Electronic Notes in Theoretical Computer Science
    • M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.
    • (1996) Proc. of WRLA
    • Clavel, M.1    Eker, S.2    Lincoln, P.3    Meseguer, J.4
  • 12
    • 0013275449 scopus 로고
    • Third order matching is decidable
    • G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 69:135-155, 1994.
    • (1994) Annals of Pure and Applied Logic , vol.69 , pp. 135-155
    • Dowek, G.1
  • 14
  • 15
    • 0031384225 scopus 로고    scopus 로고
    • An overview of CAFE specification environment - An algebraic approach for creating, verifying, and maintaining formal specifications over networks
    • K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment - an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proc. of FEM, 1997.
    • (1997) Proc. of FEM
    • Futatsugi, K.1    Nakagawa, A.2
  • 16
    • 84976856364 scopus 로고
    • Polymorphic rewriting conserves algebraic strong normalization and confluence
    • volume 372 of LNCS, Springer-Verlag
    • J. Gallier and V. Breazu-Tannen. Polymorphic rewriting conserves algebraic strong normalization and confluence. In Proc. of ICALP, volume 372 of LNCS, pages 137- 150. Springer-Verlag, 1989.
    • (1989) Proc. of ICALP , pp. 137-150
    • Gallier, J.1    Breazu-Tannen, V.2
  • 17
    • 0006263849 scopus 로고    scopus 로고
    • A lambda calculus of objects with self-inflicted extension
    • The ACM Press
    • P. Di Gianantonio, F. Honsell, and L. Liquori. A Lambda Calculus of Objects with Self-inflicted Extension. In Proc. of OOPSLA, pages 166-178. The ACM Press, 1998.
    • (1998) Proc. of OOPSLA , pp. 166-178
    • Di Gianantonio, P.1    Honsell, F.2    Liquori, L.3
  • 20
    • 0018050926 scopus 로고
    • Proving and applying program transformations expressed with second-order patterns
    • G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978
    • (1978) Acta Informatica , vol.11 , pp. 31-55
    • Huet, G.1    Lang, B.2
  • 21
    • 0000419540 scopus 로고
    • Associative-commutative pattern matching
    • J.-M. Hullot. Associative-commutative pattern matching. In Proc. of IJCAI, 1979.
    • (1979) Proc. of IJCAI
    • Hullot, J.-M.1
  • 27
    • 85034635567 scopus 로고
    • Lazy pattern matching in the ML language
    • volume 287 of LNCS, Springer-Verlag
    • A. Laville. Lazy pattern matching in the ML language. In Proc. FCT & TCS, volume 287 of LNCS, pages 400-419. Springer-Verlag, 1987.
    • (1987) Proc. FCT & TCS , pp. 400-419
    • Laville, A.1
  • 28
    • 85032177635 scopus 로고
    • A logic programming language with lambda-abstraction, function variables, and simple unification
    • volume 475 of LNCS, Springer-Verlag
    • D Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In Proc. of ELP, volume 475 of LNCS, pages 253-281. Springer-Verlag, 1991.
    • (1991) Proc. of ELP , pp. 253-281
    • Miller, D.1
  • 29
    • 0038519012 scopus 로고    scopus 로고
    • Higher-order rewriting and equational reasoning
    • W. Bibel and P. Schmitt, editors, Volume I: Foundations Kluwer
    • Tobias Nipkow and Christian Prehofer. Higher-order rewriting and equational reasoning. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications. Volume I: Foundations. Kluwer, 1998.
    • (1998) Automated Deduction - A Basis for Applications
    • Nipkow, T.1    Prehofer, C.2
  • 30
    • 85028762708 scopus 로고
    • Strong normalizability for the combined system of the typed λ calculus and an arbitrary convergent term rewrite system
    • ACM Press
    • M. Okada. Strong normalizability for the combined system of the typed λ calculus and an arbitrary convergent term rewrite system. In Proc. of ISSAC, pages 357- 363. ACM Press, 1989.
    • (1989) Proc. of ISSAC , pp. 357-363
    • Okada, M.1
  • 32
    • 84976823860 scopus 로고
    • Complete sets of reductions for some equational theories
    • G. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233-264, 1981.
    • (1981) Journal of the ACM , vol.28 , pp. 233-264
    • Peterson, G.1    Stickel, M.E.2
  • 34
    • 0009774026 scopus 로고    scopus 로고
    • Équipe Protheo. The Elan Home Page, 2001. http://elan.loria.fr.
    • (2001) The Elan Home Page
  • 36
    • 0037842587 scopus 로고
    • Lambda calculus with patterns
    • Vrije Universiteit, November
    • V. van Oostrom. Lambda calculus with patterns. Technical Report IR-228, Vrije Universiteit, November 1990.
    • (1990) Technical Report IR-228
    • Van Oostrom, V.1
  • 37
    • 0003363397 scopus 로고    scopus 로고
    • Input/output for ELAN
    • volume 4. Electronic Notes in Theoretical Computer Science
    • P. Viry. Input/Output for ELAN. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.
    • (1996) Proc. of WRLA
    • Viry, P.1
  • 38
    • 84874275328 scopus 로고    scopus 로고
    • A core language for rewriting
    • volume 15. Electronic Notes in Theoretical Computer Science
    • E. Visser and Z.e.A. Benaissa. A core language for rewriting. In Proc. of WRLA, volume 15. Electronic Notes in Theoretical Computer Science, 1998.
    • (1998) Proc. of WRLA
    • Visser, E.1    Benaissa, Z.E.A.2
  • 39
    • 0004154865 scopus 로고
    • volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press
    • D. A. Wolfram. The Clausal Theory of Types, volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1993.
    • (1993) The Clausal Theory of Types
    • Wolfram, D.A.1


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