메뉴 건너뛰기




Volumn 2441, Issue , 2002, Pages 47-66

To the gates of HAL: A HAL tutorial

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FUNCTIONAL PROGRAMMING; PROBLEM ORIENTED LANGUAGES; PROBLEM SOLVING; RECONFIGURABLE HARDWARE;

EID: 84957025047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45788-7     Document Type: Conference Paper
Times cited : (14)

References (21)
  • 6
    • 0003086356 scopus 로고
    • A minimal extension of the WAM for clp(fd)
    • [6] D. Diaz and P. Codognet. A minimal extension of the WAM for clp(fd). In Procs. of ICLP93, pages 774–790, 1993.
    • (1993) Procs. Of ICLP93 , pp. 774-790
    • Diaz, D.1    Codognet, P.2
  • 8
    • 0032186691 scopus 로고    scopus 로고
    • Theory and practice of constraint handling rules
    • [8] T. Früwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37:95–138, 1998.
    • (1998) Journal of Logic Programming , vol.37 , pp. 95-138
    • Früwirth, T.1
  • 10
    • 84957369621 scopus 로고    scopus 로고
    • Constraint representation for propagation
    • [10] W. Harvey and P. J. Stuckey. Constraint representation for propagation. In Procs. of PPCP98, pages 235–249, 1998.
    • (1998) Procs. Of PPCP98 , pp. 235-249
    • Harvey, W.1    Stuckey, P.J.2
  • 12
    • 85011175246 scopus 로고
    • Metastructures vs. Attributed variables in the context of extensible unification
    • [12] C. Holzbaur. Metastructures vs. attributed variables in the context of extensible unification. In Procs. of the PLILP92, pages 260–268, 1992.
    • (1992) Procs. Of the PLILP92 , pp. 260-268
    • Holzbaur, C.1
  • 14
    • 84957031750 scopus 로고    scopus 로고
    • ILOG. CPLEX product page. http://www.ilog.com/products/cplex/.
  • 19
    • 84956980806 scopus 로고    scopus 로고
    • The analysis framework for HAL. Master’s thesis, Dept. of Comp. Sci and Soft. Eng, University of Melbourne
    • [19] N. Nethercote. The analysis framework for HAL. Master’s thesis, Dept. of Comp. Sci and Soft. Eng, University of Melbourne, 2002.
    • (2002)
    • Nethercote, N.1
  • 20
    • 0030262017 scopus 로고    scopus 로고
    • The execution algorithm of Mercury: An efficient purely declarative logic programming language
    • [20] Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29:17–64, 1996.
    • (1996) Journal of Logic Programming , vol.29 , pp. 17-64
    • Somogyi, Z.1    Henderson, F.2    Conway, T.3
  • 21
    • 0024864871 scopus 로고
    • How to make ad-hoc polymorphism less ad-hoc
    • [21] P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. 16th ACM POPL, pages 60–76, 1989.
    • (1989) Proc. 16Th ACM POPL , pp. 60-76
    • Wadler, P.1    Blott, S.2


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