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 条
  • [1] Termination Combinators Forever
    Bolingbroke, Maximilian
    Jones, Simon Peyton
    Vytiniotis, Dimitrios
    HASKELL 11: PROCEEDINGS OF THE 2011 ACM SIGPLAN HASKELL SYMPOSIUM, 2011, : 23 - 34
  • [2] Dijkstra Monads Forever: Termination-Sensitive Specifications for Interaction Trees
    Silver, Lucas
    Zdancewic, Steve
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2021, 5 (POPL):
  • [3] SPACES WITH COMBINATORS
    GEORGIEVA, N
    ARCHIVE FOR MATHEMATICAL LOGIC, 1993, 32 (05) : 321 - 339
  • [4] ALGEBRAS AND COMBINATORS
    ENGELER, E
    ALGEBRA UNIVERSALIS, 1981, 13 (03) : 389 - 392
  • [5] CATEGORICAL COMBINATORS
    CURIEN, PL
    INFORMATION AND CONTROL, 1986, 69 (1-3): : 188 - 254
  • [6] Storage Combinators
    Weiher, Marcel
    Hirschfeld, Robert
    PROCEEDINGS OF THE 2019 ACM SIGPLAN INTERNATIONAL SYMPOSIUM ON NEW IDEAS, NEW PARADIGMS, AND REFLECTIONS ON PROGRAMMING AND SOFTWARE (ONWARD!' 19), 2019, : 111 - 127
  • [7] LINEARIZING COMBINATORS
    Cockett, Robin
    Lemay, Jean-Simon Pacaud
    THEORY AND APPLICATIONS OF CATEGORIES, 2022, 38
  • [8] Hard combinators
    Bechet, Denis
    Lippi, Sylvain
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 203 (01) : 31 - 48
  • [9] Evolving combinators
    Fuchs, M
    AUTOMATED DEDUCTION - CADE-14, 1997, 1249 : 416 - 430
  • [10] Pickler combinators
    Kennedy, AJ
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2004, 14 : 727 - 739