UNFOLDING RULES FOR GHC PROGRAMS

被引：4
|
作者：
FURUKAWA, K
OKUMURA, A
MURAKAMI, M
机构：
来源：
NEW GENERATION COMPUTING | 1988年 / 6卷 / 2-3期
关键词：
D O I：
10.1007/BF03037135
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：143 / 157
页数：15
相关论文
共 50 条
  • [1] Proving termination of GHC programs
    Rao, MRKK
    Kapur, D
    Shyamasundar, RK
    NEW GENERATION COMPUTING, 1997, 15 (03) : 293 - 338
  • [2] Proving termination of GHC programs
    Krishna Rao M.R.K.
    Kapur D.
    Shyamasundar R.K.
    New Generation Computing, 1997, 15 (3) : 293 - 338
  • [3] Unfolding for CHR programs
    Gabbrielli, Maurizio
    Meo, Maria Chiara
    Tacchella, Paolo
    Wiklicky, Herbert
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2015, 15 : 264 - 311
  • [4] Forgetting and Unfolding for Existential Rules
    Wang, Zhe
    Wang, Kewen
    Zhang, Xiaowang
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 2013 - 2020
  • [5] The HERMIT in the Machine A Plugin for the Interactive Transformation of GHC Core Language Programs
    Farmer, Andrew
    Gill, Andy
    Komp, Ed
    Sculthorpe, Neil
    ACM SIGPLAN NOTICES, 2012, 47 (12) : 1 - 12
  • [6] Reasoning with the HERMIT Tool Support for Equational Reasoning on GHC Core Programs
    Farmer, Andrew
    Sculthorpe, Neil
    Gill, Andy
    ACM SIGPLAN NOTICES, 2015, 50 (12) : 23 - 34
  • [7] Infinite unfolding and transformations of nondeterministic programs
    Lisper, B
    FUNDAMENTA INFORMATICAE, 2005, 66 (04) : 415 - 439
  • [8] Infinite unfolding and transformations of nondeterministic programs
    Lisper, B., 2005, IOS Press (66)
  • [9] Unfolding based automated testing of multithreaded programs
    Kahkonen, Kari
    Saarikivi, Olli
    Heljanko, Keijo
    AUTOMATED SOFTWARE ENGINEERING, 2015, 22 (04) : 475 - 515
  • [10] UNFOLDING, PROCEDURAL AND FIXPOINT SEMANTICS OF LOGIC PROGRAMS
    DENIS, F
    DELAHAYE, JP
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 511 - 522
12345