Higher-order matching and tree automata

被引：0
|
作者：
Comon, H [1 ]
Jurski, Y [1 ]
机构：
[1] Ecole Normale Super, Lab Specificat & Verificat, CNRS, URA 2236, F-94235 Cachan, France
来源：
COMPUTER SCIENCE LOGIC | 1998年 / 1414卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：157 / 176
页数：20
相关论文
共 50 条
  • [1] Higher-order matching, games and automata
    Stirling, Colin
    22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2007, : 326 - 335
  • [2] Verifying Higher-Order Functions with Tree Automata
    Genet, Thomas
    Haudebourg, Timothee
    Jensen, Thomas
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2018, 2018, 10803 : 565 - 582
  • [3] Higher-order parity automata
    Mellies, Paul-Andre
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [4] Higher-order matching and games
    Stirling, C
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 119 - 134
  • [5] DECIDABILITY OF HIGHER-ORDER MATCHING
    Stirling, Colin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2009, 5 (03)
  • [6] Leafy automata for higher-order concurrency
    Dixon, Alex
    Lazic, Ranko
    Murawski, Andrzej S.
    Walukiewicz, Igor
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 2021, 12650 : 184 - 204
  • [7] Higher-order matching for program transformation
    de Moor, O
    Sittampalam, G
    THEORETICAL COMPUTER SCIENCE, 2001, 269 (1-2) : 135 - 162
  • [8] Introduction to Decidability of Higher-Order Matching
    Stirling, Colin
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2010, 6014 : 1 - 1
  • [9] Verifying higher-order concurrency with data automata
    Dixon, Alex
    Lazic, Ranko
    Murawski, Andrzej S.
    Walukiewicz, Igor
    2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
  • [10] Higher-order substitution tree indexing
    Pientka, B
    LOGIC PROGRAMMING, PROCEEDINGS, 2003, 2916 : 377 - 391
12345