Coinductive techniques for higher-order languages

被引：0
作者：
Sangiorgi, Davide [1 ,2 ]
机构：
[1] Univ Bologna, Bologna, Italy
[2] INRIA, Paris, France
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2013年 / 131期
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / +
页数：5
相关论文
共 50 条
[41]   Higher-Order Intentionality and Higher-Order Acquaintance [J].
Benj Hellie .
Philosophical Studies, 2007, 134 :289-324
[42]   Higher-order intentionality and higher-order acquaintance [J].
Hellie, Benj .
PHILOSOPHICAL STUDIES, 2007, 134 (03) :289-324
[43]   A review of higher-order mode pass filtering techniques [J].
Saha, Prapty ;
Rasel, M. Salauddin ;
Ahmmed, Kazi Tanvir .
HELIYON, 2022, 8 (11)
[44]   Higher-order techniques for some problems of nonlinear control [J].
Sarychev, AV .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2002, 8 (4-5) :413-438
[45]   Analyzing the environment structure of higher-order languages using frame strings [J].
Might, Matthew ;
Shivers, Olin .
THEORETICAL COMPUTER SCIENCE, 2007, 375 (1-3) :137-168
[46]   ALGOL-LIKE LANGUAGES WITH HIGHER-ORDER PROCEDURES AND THEIR EXPRESSIVE POWER [J].
KFOURY, AJ ;
URZYCZYN, P .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 363 :186-199
[47]   Hobbits for Haskell: A Library for Higher-Order Encodings in Functional Programming Languages [J].
Westbrook, Edwin ;
Frisby, Nicolas ;
Brauner, Paul .
ACM SIGPLAN NOTICES, 2011, 46 (12) :35-46
[48]   Hobbits for Haskell: A Library for Higher-Order Encodings in Functional Programming Languages [J].
Westbrook, Edwin ;
Frisby, Nicolas ;
Brauner, Paul .
HASKELL 11: PROCEEDINGS OF THE 2011 ACM SIGPLAN HASKELL SYMPOSIUM, 2011, :35-46
[49]   A Theory of Changes for Higher-Order Languages Incrementalizing λ-Calculi by Static Differentiation [J].
Cai, Yufei ;
Giarrusso, Paolo G. ;
Rendel, Tillmann ;
Ostermann, Klaus .
ACM SIGPLAN NOTICES, 2014, 49 (06) :145-155
[50]   Learning regular languages via recurrent higher-order neural networks [J].
Tanaka, K ;
Kumazawa, I .
ICNN - 1996 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS. 1-4, 1996, :1378-1383
12345