Higher-order unification as a theorem proving procedure

被引：0
|
作者：
Hagiya, Masami
机构：
来源：
Proceedings of the International Conference on Logic Programming | 1991年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Optimizing higher-order pattern unification
    Pientka, B
    Pfenning, F
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 473 - 487
  • [22] HIGHER-ORDER UNIFICATION, POLYMORPHISM, AND SUBSORTS
    NIPKOW, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 436 - 447
  • [23] EFFICIENT FULL HIGHER-ORDER UNIFICATION
    Vukmirovic, Petar
    Bentkamp, Alexander
    Nummelin, Visa
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (04)
  • [24] Decidable variants of higher-order unification
    Schmidt-Schauss, M
    MECHANIZING MATHEMATICAL REASONING: ESSAYS IN HONOUR OF JORG H SIEKMANN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2005, 2605 : 154 - 168
  • [25] Decidability of bounded higher-order unification
    Schmidt-Schauss, M
    Schulz, KU
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2002, 2471 : 522 - 536
  • [26] Optimization of Executable Formal Interpreters Developed in Higher-Order Logic Theorem Proving Systems
    Yang, Zheng
    Lei, Hang
    IEEE ACCESS, 2018, 6 : 70331 - 70348
  • [27] The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
    Mintchev, S
    Lester, D
    HIGHER-ORDER ALGEBRA, LOGIC, AND TERM REWRITING, 1996, 1074 : 144 - 162
  • [28] Comparing Unification Algorithms in First-Order Theorem Proving
    Hoder, Krystof
    Voronkov, Andrei
    KI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5803 : 435 - 443
  • [29] Proving pointer programs in higher-order logic
    Mehta, F
    Nipkow, T
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 121 - 135
  • [30] Proving and disproving termination of higher-order functions
    Giesl, J
    Thiemann, R
    Schneider-Kamp, P
    FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2005, 3717 : 216 - 231
12345