메뉴 건너뛰기




Volumn 4421 LNCS, Issue , 2007, Pages 110-124

Anti-pattern matching

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LOGIC PROGRAMMING; PATTERN MATCHING; PROBLEM SOLVING; SEMANTICS;

EID: 37149055444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_9     Document Type: Conference Paper
Times cited : (20)

References (20)
  • 1
    • 0002902902 scopus 로고
    • Decidability of systems of set constraints with negative constraints
    • A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Information and Computation, 122(1):30-44, 1995.
    • (1995) Information and Computation , vol.122 , Issue.1 , pp. 30-44
    • Aiken, A.1    Kozen, D.2    Wimmers, E.3
  • 2
    • 0026881286 scopus 로고
    • Solving systems of set constraints (extended abstract)
    • IEEE Computer Society
    • A. Aiken and E. L. Wimmers. Solving systems of set constraints (extended abstract). In LICS, pages 329-340. IEEE Computer Society, 1992.
    • (1992) LICS , pp. 329-340
    • Aiken, A.1    Wimmers, E.L.2
  • 3
    • 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
  • 6
    • 0029343331 scopus 로고
    • A complete and recursive feature theory
    • July
    • R. Backofen and G. Smolka. A complete and recursive feature theory. Theoretical Computer Science, 146(1-2):243-268, July 1995.
    • (1995) Theoretical Computer Science , vol.146 , Issue.1-2 , pp. 243-268
    • Backofen, R.1    Smolka, G.2
  • 7
    • 0028064075 scopus 로고
    • Negative set constraints with equality
    • IEEE Computer Society
    • W. Charatonik and L. Pacholski. Negative set constraints with equality. In LICS, pages 128-136. IEEE Computer Society, 1994.
    • (1994) LICS , pp. 128-136
    • Charatonik, W.1    Pacholski, L.2
  • 9
    • 37149017283 scopus 로고    scopus 로고
    • H. Comon. Unification et disunification. Théories et applications. Thèse de Doctorat d'Université, Institut Polytechnique de Grenoble (France), 1988.
    • H. Comon. Unification et disunification. Théories et applications. Thèse de Doctorat d'Université, Institut Polytechnique de Grenoble (France), 1988.
  • 10
    • 0002866579 scopus 로고
    • Disunification: A survey
    • J.-L. Lassez and G. Plotkin, editors, chapter 9, The MIT press, Cambridge MA, USA
    • H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 9, pages 322359. The MIT press, Cambridge (MA, USA), 1991.
    • (1991) Computational Logic. Essays in honor of Alan Robinson , pp. 322359
    • Comon, H.1
  • 11
    • 37149042211 scopus 로고
    • Equational problems and disunification
    • C. Kirchner, editor, Academic Press inc, London
    • H. Comon and P. Lescanne. Equational problems and disunification. In C. Kirchner, editor, Unification, pages 297-352. Academic Press inc., London, 1990.
    • (1990) Unification , pp. 297-352
    • Comon, H.1    Lescanne, P.2
  • 15
    • 33746051723 scopus 로고    scopus 로고
    • Formal validation of pattern matching code
    • P. Barahona and A. Felty, editors, ACM, July
    • C. Kirchner, P.-E. Moreau, and A. Reilles. Formal validation of pattern matching code. In P. Barahona and A. Felty, editors, Proceedings of the 7th ACM SIGPLAN PPDP, pages 187-197. ACM, July 2005.
    • (2005) Proceedings of the 7th ACM SIGPLAN PPDP , pp. 187-197
    • Kirchner, C.1    Moreau, P.-E.2    Reilles, A.3
  • 16
    • 0001323323 scopus 로고
    • Explicit representation of terms defined by counter examples
    • J.-L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning, 3(3):301-317, 1987.
    • (1987) Journal of Automated Reasoning , vol.3 , Issue.3 , pp. 301-317
    • Lassez, J.-L.1    Marriott, K.2
  • 18
    • 37149045857 scopus 로고    scopus 로고
    • Elimination of negation in a logical framework
    • Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic, of, London, UK, Springer Verlag
    • A. Momigliano. Elimination of negation in a logical framework. In Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic, volume 1862 of LNCS, pages 411-426, London, UK, 2000. Springer Verlag.
    • (2000) LNCS , vol.1862 , pp. 411-426
    • Momigliano, A.1
  • 19
    • 21144432063 scopus 로고    scopus 로고
    • A Pattern Matching Compiler for Multiple Target Languages
    • G. Hedin, editor, 12th Conference on Compiler Construction, Warsaw Poland, of, Springer-Verlag, May
    • P.-E. Moreau, C. Ringeissen, and M. Vittek. A Pattern Matching Compiler for Multiple Target Languages. In G. Hedin, editor, 12th Conference on Compiler Construction, Warsaw (Poland), volume 2622 of LNCS, pages 61-76. Springer-Verlag, May 2003.
    • (2003) LNCS , vol.2622 , pp. 61-76
    • Moreau, P.-E.1    Ringeissen, C.2    Vittek, M.3
  • 20
    • 84956995199 scopus 로고    scopus 로고
    • Inclusion constraints over non-empty sets of trees
    • M. Dauchet, editor, Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, of, Springer Verlag, Apr
    • M. Müller, J. Niehren, and A. Podelski. Inclusion constraints over non-empty sets of trees. In M. Dauchet, editor, Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, volume 1214 of LNCS, pages 217-231. Springer Verlag, Apr. 1997.
    • (1997) LNCS , vol.1214 , pp. 217-231
    • Müller, M.1    Niehren, J.2    Podelski, A.3


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