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
关键词
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 条
  • [41] Regular Combinators for String Transformations
    Alur, Rajeev
    Freilich, Adam
    Raghothaman, Mukund
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [42] ON THE INTERPRETATION OF COMBINATORS WITH WEAK REDUCTION
    SHABUNIN, LV
    JOURNAL OF SYMBOLIC LOGIC, 1983, 48 (03) : 558 - 563
  • [43] GLL Parsing with Flexible Combinators
    van Binsbergen, L. Thomas
    Scott, Elizabeth
    Johnstone, Adrian
    PROCEEDINGS OF THE 11TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON SOFTWARE LANGUAGE ENGINEERING (SLE '18), 2018, : 16 - 28
  • [44] Pipeline Combinators for Gradual AutoML
    Baudart, Guillaume
    Hirzel, Martin
    Kate, Kiran
    Ram, Parikshit
    Shinnar, Avraham
    Tsay, Jason
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [45] Service combinators for Web computing
    Cardelli, L
    Davies, R
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1999, 25 (03) : 309 - 316
  • [46] A New View on Parser Combinators
    Koopman, Pieter
    Plasmeijer, Rinus
    PROCEEDINGS OF THE 31ST SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES, IFL 2019, 2019,
  • [47] COMPACT NUMERAL REPRESENTATION WITH COMBINATORS
    KRISHNAMURTHY, EV
    VICKERS, BP
    JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (02) : 519 - 525
  • [48] COMBINATORS FOR SEED BAD PREPARATION
    KNAKAL, Z
    HRUBY, J
    LISTY CUKROVARNICKE A REPARSKE, 1993, 109 (02): : 38 - 39
  • [49] Staged Selective Parser Combinators
    Willis, Jamie
    Wu, Nicolas
    Pickering, Matthew
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (ICFP):
  • [50] Logical combinators for system configuration
    City Univ, London, United Kingdom
    Period Polytech Electr Eng, 1 (25-32):