Termination Combinators Forever

被引：0
|
作者：
Bolingbroke, Maximilian [1 ]
Jones, Simon Peyton [2 ]
Vytiniotis, Dimitrios [2 ]
机构：
[1] Univ Cambridge, Cambridge CB2 1TN, England
[2] Microsoft Res Cambridge, Cambridge, England
来源：
ACM SIGPLAN NOTICES | 2011年 / 46卷 / 12期
关键词：
Algorithms; Theory;
D O I：
10.1145/2096148.2034680
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We describe a library-based approach to constructing termination tests suitable for controlling termination of symbolic methods such as partial evaluation, supercompilation and theorem proving. With our combinators, all termination tests are correct by construction. We show how the library can be designed to embody various optimisations of the termination tests, which the user of the library takes advantage of entirely transparently.
引用
收藏
页码：23 / 34
页数：12
相关论文
共 50 条
  • [31] Fair enumeration combinators
    New, Max S.
    Fetscher, Burke
    Findler, Robert Bruce
    Mccarthy, Jay
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2017, 27
  • [32] PERPETUITY IS FOREVER, ALMOST ALWAYS: WHY IT IS WRONG TO PROMOTE AMENDMENT AND TERMINATION OF PERPETUAL CONSERVATION EASEMENTS
    Schwing, Ann Taylor
    HARVARD ENVIRONMENTAL LAW REVIEW, 2013, 37 (01) : 217 - 246
  • [33] REPRESENTATION OF MARKOV ALGORITHMS BY COMBINATORS
    CURRY, HB
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (06): : A590 - A590
  • [34] CATEGORICAL MULTI-COMBINATORS
    LINS, RD
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 274 : 60 - 79
  • [35] Practical, General Parser Combinators
    Izmaylova, Anastasia
    Afroozeh, Ali
    van der Storm, Tijs
    PEPM'16: PROCEEDINGS OF THE 2016 ACM SIGPLAN WORKSHOP ON PARTIAL EVALUATION AND PROGRAM MANIPULATION, 2016, : 1 - 12
  • [36] Lambda terms definable as combinators
    Bunder, MW
    THEORETICAL COMPUTER SCIENCE, 1996, 169 (01) : 3 - 21
  • [37] Some additions to the theory of combinators
    Curry, HB
    AMERICAN JOURNAL OF MATHEMATICS, 1932, 54 : 551 - 558
  • [38] Expressive Logical Combinators for Free
    Geneves, Pierre
    Schmitt, Alan
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 311 - 317
  • [39] Efficient parsing with parser combinators
    Kurs, Jan
    Vrany, Jan
    Ghafari, Mohammad
    Lungu, Mircea
    Nierstrasz, Oscar
    SCIENCE OF COMPUTER PROGRAMMING, 2018, 161 : 57 - 88
  • [40] Service combinators for Web computing
    Microsoft Research, Cambridge, CB2 3NH, United Kingdom
    不详
    IEEE Trans Software Eng, 3 (309-316):
12345