메뉴 건너뛰기




Volumn 3835 LNAI, Issue , 2005, Pages 110-124

Optimizing the runtime processing of types in polymorphic logic programming languages

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROCESSES; PREPROCESSING; RUNTIME PROCESSING;

EID: 33745443921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_9     Document Type: Conference Paper
Times cited : (5)

References (15)
  • 1
    • 84969366929 scopus 로고
    • Horn clause programs with polymorphic types: Semantics and resolution
    • J. Diaz and F. Orejas, editors. Springer-Verlag. Lecture Notes in Computer Science
    • M. Hanus. Horn clause programs with polymorphic types: Semantics and resolution. In J. Diaz and F. Orejas, editors, TAPSOFT 89, pages 225-240. Springer-Verlag, 1989. Lecture Notes in Computer Science Vol 352.
    • (1989) TAPSOFT 89 , vol.352 , pp. 225-240
    • Hanus, M.1
  • 2
    • 33745446515 scopus 로고
    • Polymorphic higher-order programming in Prolog
    • G. Levi and M. Martelli, editors, MIT Press
    • M. Hanus. Polymorphic higher-order programming in Prolog. In G. Levi and M. Martelli, editors, Proceedings of the Sixth International Logic Programming Conference, pages 382-398. MIT Press, 1989.
    • (1989) Proceedings of the Sixth International Logic Programming Conference , pp. 382-398
    • Hanus, M.1
  • 3
    • 49549145605 scopus 로고
    • A unification algorithm for typed A-calculus
    • G. Huet. A unification algorithm for typed A-calculus. Theoretical Computer Science, 1:27-57, 1975.
    • (1975) Theoretical Computer Science , vol.1 , pp. 27-57
    • Huet, G.1
  • 4
    • 0028400371 scopus 로고
    • Implementing polymorphic typing in a logic programming language
    • K. Kwon, G. Nadathur, and D.S. Wilson. Implementing polymorphic typing in a logic programming language. Computer Languages, 20(1):25-42, 1994.
    • (1994) Computer Languages , vol.20 , Issue.1 , pp. 25-42
    • Kwon, K.1    Nadathur, G.2    Wilson, D.S.3
  • 5
    • 0026303964 scopus 로고
    • Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system
    • V. Saraswat and K. Ueda, editors. MIT Press
    • T.K. Lakshman and U.S. Reddy. Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Programming Symposium, pages 202-217. MIT Press, 1991.
    • (1991) Proceedings of the International Logic Programming Symposium , pp. 202-217
    • Lakshman, T.K.1    Reddy, U.S.2
  • 7
    • 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.
    • (1991) Journal of Logic and Computation , vol.1 , Issue.4 , pp. 497-536
    • Miller, D.1
  • 10
    • 33745432597 scopus 로고    scopus 로고
    • Practical higher-order pattern unification with on-the-fly raising
    • Technical Report 2005/2, Digital Technology Center, April To appear
    • G. Nadathur and N. Linnell. Practical higher-order pattern unification with on-the-fly raising. Technical Report 2005/2, Digital Technology Center, April 2005. To appear in the Proceedings of ICLP'05.
    • (2005) Proceedings of ICLP'05
    • Nadathur, G.1    Linnell, N.2
  • 11
    • 84957611918 scopus 로고    scopus 로고
    • System description: Teyjus - A compiler and abstract machine based implementation of AProlog
    • H. Ganzinger, editor, number 1632 in Lecture Notes in Artificial Intelligence. Springer-Verlag, July
    • G. Nadathur and D.J. Mitchell. System description: Teyjus - a compiler and abstract machine based implementation of AProlog. In H. Ganzinger, editor, Automated Deduction-CADE-16, number 1632 in Lecture Notes in Artificial Intelligence, pages 287-291. Springer-Verlag, July 1999.
    • (1999) Automated Deduction-CADE-16 , pp. 287-291
    • Nadathur, G.1    Mitchell, D.J.2
  • 12
    • 2142740967 scopus 로고
    • The type system of a higher-order logic programming language
    • F. Pfenning, editor. MIT Press
    • G. Nadathur and F. Pfenning. The type system of a higher-order logic programming language. In F. Pfenning, editor, Types in Logic Programming, pages 245-283. MIT Press, 1992.
    • (1992) Types in Logic Programming , pp. 245-283
    • Nadathur, G.1    Pfenning, F.2
  • 13
    • 0027208449 scopus 로고
    • Functional unification of higher-order patterns
    • IEEE Computer Society Press, June
    • T. Nipkow. Functional unification of higher-order patterns. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 64-74. IEEE Computer Society Press, June 1993.
    • (1993) Eighth Annual IEEE Symposium on Logic in Computer Science , pp. 64-74
    • Nipkow, T.1
  • 14
    • 0024880684 scopus 로고
    • Elf: A language for logic definition and verified metaprogramming
    • IEEE Computer Society Press, June
    • F. Pfenning. Elf: A language for logic definition and verified metaprogramming. In Fourth Annual Symposium on Logic in Computer Science, pages 313-322. IEEE Computer Society Press, June 1989.
    • (1989) Fourth Annual Symposium on Logic in Computer Science , pp. 313-322
    • Pfenning, F.1


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