메뉴 건너뛰기




Volumn 32, Issue 1, 2009, Pages

Parametric polymorphism for XML

Author keywords

Polymorphism; Subtyping; Tree automata; XML

Indexed keywords

ABSTRACT TYPES; COMPLETE PROBLEMS; PARAMETERIZED; PARAMETRIC POLYMORPHISM; PARAMETRICITY; POLYMORPHIC TYPE SYSTEMS; POLYMORPHIC TYPES; PRACTICAL ALGORITHMS; SCHEMAS; SEMANTIC APPROACH; STATIC TYPING; SUBTYPING RELATION; SUBTYPINGS; TREE AUTOMATA; TYPE ARGUMENTS; TYPE VARIABLES; TYPECHECKING; XML PROCESSING; XML TYPES;

EID: 75649112624     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1596527.1596529     Document Type: Article
Times cited : (13)

References (55)
  • 1
    • 0002902902 scopus 로고
    • Decidability of systems of set constraints with negative constraints
    • AIKEN, A., KOZEN, D., AND WIMMERS, E. L. 1995. Decidability of systems of set constraints with negative constraints. Inf. Comput. 122, 1, 30-44.
    • (1995) Inf. Comput. , vol.122 , Issue.1 , pp. 30-44
    • Aiken, A.1    Kozen, D.2    Wimmers, E.L.3
  • 17
    • 34247184788 scopus 로고    scopus 로고
    • OCaml + XDuce
    • FRISCH, A. 2006. OCaml + XDuce. SIGPLAN Not. 41, 9, 192-200.
    • (2006) SIGPLAN Not. , vol.41 , Issue.9 , pp. 192-200
    • Frisch, A.1
  • 19
    • 52249093623 scopus 로고    scopus 로고
    • Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
    • FRISCH, A., CASTAGNA, G., AND BENZAKEN, V. 2008. Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types. J. ACM 55, 4, 1-64.
    • (2008) J. ACM , vol.55 , Issue.4 , pp. 1-64
    • Frisch, A.1    Castagna, G.2    Benzaken, V.3
  • 20
    • 0004479469 scopus 로고    scopus 로고
    • Set constraints and automata
    • GILLERON, R., TISON, S., AND TOMMASI, M. 1999. Set constraints and automata. Inf. Comput. 149, 1, 1-41.
    • (1999) Inf. Comput. , vol.149 , Issue.1 , pp. 1-41
    • Gilleron, R.1    Tison, S.2    Tommasi, M.3
  • 22
    • 1142270545 scopus 로고    scopus 로고
    • Regular expression pattern matching-a simpler design
    • RIMS, Kyoto Univ., Kyoto, Japan
    • HOSOYA, H. 2003. Regular expression pattern matching-a simpler design. Tech. Rep. 1397, RIMS, Kyoto Univ., Kyoto, Japan.
    • (2003) Tech. Rep. , pp. 1397
    • Hosoya, H.1
  • 23
    • 33750262287 scopus 로고    scopus 로고
    • Regular expression filters for XML
    • (Short version appeared in Proceedings of Programming Language Technologies for XML (PLAN-X), pp. 13-27, 2004.)
    • HOSOYA, H. 2006. Regular expression filters for XML. J. Funct. Prog. 16, 6, 711-750. (Short version appeared in Proceedings of Programming Language Technologies for XML (PLAN-X), pp.13-27, 2004.)
    • (2006) J. Funct. Prog. , vol.16 , Issue.6 , pp. 711-750
    • Hosoya, H.1
  • 25
    • 35248900050 scopus 로고    scopus 로고
    • Boolean operations and inclusion test for attribute-element constraints
    • Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany
    • HOSOYA,H. ANDMURATA,M. 2003. Boolean operations and inclusion test for attribute-element constraints. In Proceedings of the 8th International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, vol.2759. Springer-Verlag, Berlin, Germany, 201-212.
    • (2003) Proceedings of the 8th International Conference on Implementation and Application of Automata , vol.2759 , pp. 201-212
    • Hosoya, H.1    Murata, M.2
  • 26
    • 0242636425 scopus 로고    scopus 로고
    • Regular expression pattern matching for XML
    • (Short version appeared in Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 2001, pp. 67-80.)
    • HOSOYA, H. AND PIERCE, B. C. 2002. Regular expression pattern matching for XML. J. Funct. Prog. 13, 6, 961-1004. (Short version appeared in Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 2001, pp. 67-80.)
    • (2002) J. Funct. Prog. , vol.13 , Issue.6 , pp. 961-1004
    • Hosoya, H.1    Pierce, B.C.2
  • 27
    • 1442286447 scopus 로고    scopus 로고
    • XDuce: A typed XML processing language
    • (Short version appeared in Proceedings of the 3rd International Workshop on the Web and Databases (WebDB2000), Lecture Notes in Computer Science, vol. 1997. Springer-Verlag, Berlin, Germany, pp. 226-244
    • HOSOYA, H. AND PIERCE, B. C. 2003. XDuce: A typed XML processing language. ACM Trans. Internet Tech. 3, 2, 117-148. (Short version appeared in Proceedings of the 3rd International Workshop on the Web and Databases (WebDB2000), Lecture Notes in Computer Science, vol.1997. Springer-Verlag, Berlin, Germany, pp. 226-244.
    • (2003) ACM Trans. Internet Tech. , vol.3 , Issue.2 , pp. 117-148
    • Hosoya, H.1    Pierce, B.C.2
  • 28
    • 13644276604 scopus 로고    scopus 로고
    • Regular expression types for XML
    • DOI 10.1145/1053468.1053470
    • HOSOYA, H., VOUILLON, J., AND PIERCE, B. C. 2004. Regular expression types for XML. ACM Trans. Prog. Lang. Syst. 27, 1, 46-90. (Short version appeared in Proceedings of the International Conference on Functional Programming (ICFP), pp. 11-22, 2000.) (Pubitemid 40232358)
    • (2005) ACM Transactions on Programming Languages and Systems , vol.27 , Issue.1 , pp. 46-90
    • Hosoya, H.1    Vouillon, J.2    Pierce, B.C.3
  • 40
    • 75649089084 scopus 로고    scopus 로고
    • OASIS
    • OASIS. 2002. DocBook. http://www.docbook.org.
    • (2002) Doc Book
  • 43
    • 33750410325 scopus 로고    scopus 로고
    • PYTHON XML SPECIAL INTEREST GROUP
    • PYTHON XML SPECIAL INTEREST GROUP. 1998. The XML bookmark exchange language. http://pyxml.sourceforge.net/topics/xbel/.
    • (1998) The XML Bookmark Exchange Language
  • 44
    • 0020919435 scopus 로고
    • Types, abstraction, and parametric polymorphism
    • REYNOLDS, J. C. 1983. Types, abstraction, and parametric polymorphism. Inf. Proc. 83, 513-523.
    • (1983) Inf. Proc. , vol.83 , pp. 513-523
    • Reynolds, J.C.1
  • 46
    • 0028101667 scopus 로고
    • Systems of set constraints with negative constraints are nexptimecomplete
    • IEEE Computer Society Press, Los Alamitos, CA
    • STEF́ENSSON, K. 1994. Systems of set constraints with negative constraints are nexptimecomplete. In Proceedings of 9th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 137-141.
    • (1994) Proceedings of 9th Annual IEEE Symposium on Logic in Computer Science , pp. 137-141
    • Stef́ensson, K.1
  • 51
    • 35248814928 scopus 로고    scopus 로고
    • XML schema containment checking based on semi-implicit techniques
    • Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany
    • TOZAWA, A. AND HAGIYA, M. 2003. XML schema containment checking based on semi-implicit techniques. In Proceedings of the 8th International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, vol.2759. Springer-Verlag, Berlin, Germany, 213-225.
    • (2003) Proceedings of the 8th International Conference on Implementation and Application of Automata , vol.2759 , pp. 213-225
    • Tozawa, A.1    Hagiya, M.2
  • 52
    • 33745396295 scopus 로고    scopus 로고
    • Type inference for unique pattern matching
    • VANSUMMEREN, S. 2006. Type inference for unique pattern matching. ACM Trans. Prog. Lang. Syst. 28, 3, 389-428.
    • (2006) ACM Trans. Prog. Lang. Syst. , vol.28 , Issue.3 , pp. 389-428
    • Vansummeren, S.1


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