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 条
  • [21] Total Parser Combinators
    Danielsson, Nils Anders
    ICFP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2010, : 285 - 296
  • [22] ITERATIVE SEQUENCES OF COMBINATORS
    ROBINET, B
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1982, 295 (01): : 29 - 30
  • [23] Optimizing Parser Combinators
    Kurs, Jan
    Vrany, Jan
    Ghafari, Mohammad
    Lungu, Mircea
    Nierstrasz, Oscar
    PROCEEDINGS OF THE 11TH EDITION OF THE INTERNATIONAL WORKSHOP ON SMALLTALK TECHNOLOGIES, (IWST 2016), 2016,
  • [24] Total Parser Combinators
    Danielsson, Nils Anders
    ACM SIGPLAN NOTICES, 2010, 45 (09) : 285 - 296
  • [25] DIRECTOR STRINGS AS COMBINATORS
    KENNAWAY, R
    SLEEP, R
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1988, 10 (04): : 602 - 626
  • [26] Distributed Protocol Combinators
    Andersen, Kristoffer Just Arndal
    Sergey, Ilya
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES (PADL 2019), 2019, 11372 : 169 - 186
  • [27] FUNCTIONAL PROGRAMMING WITH COMBINATORS
    GIBERT, J
    JOURNAL OF SYMBOLIC COMPUTATION, 1987, 4 (03) : 269 - 293
  • [28] On principal types of combinators
    Broda, S
    Damas, L
    THEORETICAL COMPUTER SCIENCE, 2000, 247 (1-2) : 277 - 290
  • [29] On the word problem for combinators
    Statman, R
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2000, 1833 : 203 - 213
  • [30] Graph parser combinators
    Mazanek, Steffen
    Minas, Mark
    IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES, 2008, 5083 : 1 - 18
12345