THE PROVABLY RECURSIVE FUNCTIONS OF PREDICATIVE HIGHER-ORDER LOGICS

被引：0
|
作者：
LEIVANT, D
机构：
来源：
JOURNAL OF SYMBOLIC LOGIC | 1984年 / 49卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：1448 / 1448
页数：1
相关论文
共 50 条
  • [1] Partial recursive functions in Higher-Order Logic
    Krauss, Alexander
    [J]. AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 589 - 603
  • [2] HIGHER-ORDER FUNCTIONS IN 1ST-ORDER LOGICS
    VORONKOV, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 601 : 43 - 54
  • [3] Descriptive and relative completeness of logics for higher-order functions
    Honda, Kohei
    Berger, Martin
    Yoshida, Nobuko
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, 2006, 4052 : 360 - 371
  • [4] On evolving of recursive functions using λ-abstraction and higher-order functions
    Dostal, Martin
    [J]. LOGIC JOURNAL OF THE IGPL, 2005, 13 (05) : 515 - 524
  • [5] Validating and Animating Higher-Order Recursive Functions in B
    Leuschel, Michael
    Cansell, Dominique
    Butler, Michael
    [J]. RIGOROUS METHODS FOR SOFTWARE CONSTRUCTION AND ANALYSIS: EASSYS DEDICATED TO EGON BORGER ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5115 : 78 - +
  • [6] Provably Secure Higher-Order Masking of AES
    Rivain, Matthieu
    Prouff, Emmanuel
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2010, 2010, 6225 : 413 - 427
  • [7] Higher-order Representation of Substructural Logics
    Crary, Karl
    [J]. ICFP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2010, : 131 - 141
  • [8] Light Logics and Higher-Order Processes
    Dal Lago, Ugo
    Martini, Simone
    Sangiorgi, Davide
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (41): : 46 - 60
  • [9] A GLIMPSE INTO HIGHER-ORDER CONNEXIVE LOGICS
    Francez, Nissim
    [J]. LOGIQUE ET ANALYSE, 2022, (257) : 101 - 110
  • [10] Computing queries with higher-order logics
    Hella, L
    Turull-Torres, JM
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 355 (02) : 197 - 214
12345