메뉴 건너뛰기




Volumn 1722, Issue , 1999, Pages 335-352

Typed higher-order narrowing without higher-order strategies

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING;

EID: 84957684338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_22     Document Type: Conference Paper
Times cited : (19)

References (15)
  • 1
    • 84957612447 scopus 로고    scopus 로고
    • Optimal non-deterministic functional logic computations
    • Southampton, UK, Sept, Springer LNCS 1298
    • S. Antoy. Optimal non-deterministic functional logic computations. In Proc, of the 6th Int. Conference on Algebraic and Logic Programming (ALF'97), pages 16-30, Southampton, UK, Sept. 1997. Springer LNCS 1298. 337, 349
    • (1997) Proc, of the 6Th Int. Conference on Algebraic and Logic Programming (ALF'97) , pp. 16-30
    • Antoy, S.1
  • 5
    • 18144388050 scopus 로고
    • A correctness proof for Warren's HO into FO translation
    • Gizzeria Lido, IT, Oct
    • J.C. Gonzalez-Moreno. A correctness proof for Warren's HO into FO translation. In Proc. GULF' 93, pages 569-585, Gizzeria Lido, IT, Oct. 1993. 336, 336, 337, 337, 342, 343, 348, 348, 348, 348, 348
    • (1993) Proc. GULF' 93 , pp. 569-585
    • Gonzalez-Moreno, J.C.1
  • 7
    • 33745446515 scopus 로고
    • Polymorphic higher-order programming in prolog
    • MIT Press, June
    • Michael Hanus. Polymorphic higher-order programming in prolog. In Proc. 6th International Conference on Logic Frogramming, pages 382-397. MIT Press, June 1989. 336, 346
    • (1989) Proc. 6Th International Conference on Logic Frogramming , pp. 382-397
    • Hanus, M.1
  • 9
    • 0000968273 scopus 로고
    • A logic programming language with lambda-abstraction, function variables, and simple unification
    • D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991. 337, 350
    • (1991) Journal of Logic and Computation , vol.1 , Issue.4 , pp. 497-536
    • Miller, D.1
  • 11
    • 85035001592 scopus 로고
    • Definitional interpreters for higher-order programming languages
    • ACM
    • J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM National Conference, pages 717-740. ACM, 1972. 336, 337
    • (1972) ACM National Conference , pp. 717-740
    • Reynolds, J.C.1
  • 12
    • 0032281046 scopus 로고    scopus 로고
    • From ML to Ada: Strongly-typed language interoperability via source translation
    • July
    • A. Tolmach and D. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Frogramming, 8(4):367-412, July 1998. 337, 337, 346
    • (1998) Journal of Functional Frogramming , vol.8 , Issue.4 , pp. 367-412
    • Tolmach, A.1    Oliva, D.2
  • 14
    • 85042810898 scopus 로고    scopus 로고
    • June, Boston College Computer Science Technical Report BCCS-97-03
    • Proc. Workshop on Types in Compilation (TIC97), June 1997. Boston College Computer Science Technical Report BCCS-97-03. 336
    • (1997) Proc. Workshop on Types in Compilation (TIC97)


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