메뉴 건너뛰기




Volumn 3668, Issue , 2005, Pages 371-386

Practical higher-order pattern unification with on-the-fly raising

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; PROGRAM PROCESSORS;

EID: 27144518443     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_28     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 1
    • 0034711983 scopus 로고    scopus 로고
    • Higher-order unification via explicit substitutions
    • G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. Information and Computation, 157:183-235, 2000.
    • (2000) Information and Computation , vol.157 , pp. 183-235
    • Dowek, G.1    Hardin, T.2    Kirchner, C.3
  • 2
    • 0001773631 scopus 로고    scopus 로고
    • Unification via explicit substitutions: The case for higher-order patterns
    • INRIA, December
    • G. Dowek, T. Hardin, C. Kirchner, and F. Pfenning. Unification via explicit substitutions: The case for higher-order patterns. Technical Report 3591, INRIA, December 1998.
    • (1998) Technical Report , vol.3591
    • Dowek, G.1    Hardin, T.2    Kirchner, C.3    Pfenning, F.4
  • 3
    • 49549145605 scopus 로고
    • A unification algorithm for typed λ-calculus
    • G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
    • (1975) Theoretical Computer Science , vol.1 , pp. 27-57
    • Huet, G.1
  • 4
    • 21044446258 scopus 로고    scopus 로고
    • Choices in representation and reduction strategies for lambda terms in intensional contexts
    • C. Liang, G. Nadathur, and X. Qi. Choices in representation and reduction strategies for lambda terms in intensional contexts. Journal of Automated Reasoning, 33:89-132, 2005.
    • (2005) Journal of Automated Reasoning , vol.33 , pp. 89-132
    • Liang, C.1    Nadathur, G.2    Qi, X.3
  • 6
    • 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
  • 7
    • 0000100589 scopus 로고
    • Unification under a mixed prefix
    • D. Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14:321-358, 1992.
    • (1992) Journal of Symbolic Computation , vol.14 , pp. 321-358
    • Miller, D.1
  • 9
    • 0002047775 scopus 로고
    • An overview of λProlog
    • K. A. Bowen and R. A. Kowalski, editors, MIT Press, August
    • G. Nadathur and D. Miller. An overview of λProlog. In K. A. Bowen and R. A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-827. MIT Press, August 1988.
    • (1988) Fifth International Logic Programming Conference , pp. 810-827
    • Nadathur, G.1    Miller, D.2
  • 10
    • 84957611918 scopus 로고    scopus 로고
    • System description: Teyjus - A compiler and abstract machine based implementation of λProlog
    • H. Ganzinger, editor, number 1632 in LNAI, Springer
    • G. Nadathur and D.J. Mitchell. System description: Teyjus - a compiler and abstract machine based implementation of λProlog. In H. Ganzinger, editor, Automated Deduction-CADE-16, number 1632 in LNAI, pages 287-291. Springer, 1999.
    • (1999) Automated Deduction-CADE-16 , pp. 287-291
    • Nadathur, G.1    Mitchell, D.J.2
  • 12
    • 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
  • 13
    • 0348126394 scopus 로고    scopus 로고
    • Isabelle/HOL - A proof assistant for higher-order logic
    • Springer
    • T. Nipkow, L.C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
    • (2002) LNCS , vol.2283
    • Nipkow, T.1    Paulson, L.C.2    Wenzel, M.3
  • 14
    • 0002474842 scopus 로고
    • Logic programming in the LF logical framework
    • G. Huet and G. D. Plotkin, editors, Cambridge University Press
    • F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
    • (1991) Logical Frameworks
    • Pfenning, F.1
  • 16
    • 35448990873 scopus 로고    scopus 로고
    • System description: Twelf - A meta-logical framework for deductive systems
    • H. Ganzinger, editor, number 1632 in LNAI, Springer, July
    • F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Automated Deduction-CADE-16, number 1632 in LNAI, pages 202-206. Springer, July 1999.
    • (1999) Automated Deduction-CADE-16 , pp. 202-206
    • Pfenning, F.1    Schürmann, C.2
  • 18
    • 4243153432 scopus 로고    scopus 로고
    • Unification of higher-order patterns in linear time and space
    • Z. Qian. Unification of higher-order patterns in linear time and space. Journal of Logic and Computation, 6(3):315-341, 1996.
    • (1996) Journal of Logic and Computation , vol.6 , Issue.3 , pp. 315-341
    • Qian, Z.1


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