Roland Axelsson, Martin Lange & Rafal Somla (2007):
The Complexity of Model Checking Higher-Order Fixpoint Logic.
Logical Methods in Computer Science 3(2),
doi:10.2168/LMCS-3(2:7)2007.
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague & Olivier Serre (2013):
C-SHORe: a collapsible approach to higher-order verification.
In: ACM SIGPLAN International Conference on Functional Programming, ICFP'13, Boston, MA, USA - September 25 - 27, 2013,
pp. 13–24,
doi:10.1145/2500365.2500589.
Florian Bruse (2014):
Alternating Parity Krivine Automata.
In: Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger & Zoltán Ésik: Mathematical Foundations of Computer Science 2014,
Lecture Notes in Computer Science 8634.
Springer Berlin Heidelberg,
pp. 111–122,
doi:10.1007/978-3-662-44522-8_10.
Thierry Cachat (2003):
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games.
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings,
pp. 556–569,
doi:10.1007/3-540-45061-0_45.
Arnaud Carayol & Olivier Serre (2012):
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection.
In: LICS,
pp. 165–174,
doi:10.1109/LICS.2012.73.
Werner Damm (1982):
The IO- and OI-hierarchies.
Theoretical Computer Science 20(2),
pp. 95 – 207,
doi:10.1016/0304-3975(82)90009-3.
Anuj Dawar, Erich Grädel & Stephan Kreutzer (2004):
Inflationary fixed points in modal logic.
ACM Trans. Comput. Log. 5(2),
pp. 282–315,
doi:10.1145/976706.976710.
Jean-Christophe Filliâtre & Sylvain Conchon (2006):
Type-safe Modular Hash-consing.
In: Proceedings of the 2006 Workshop on ML,
ML '06.
ACM,
New York, NY, USA,
pp. 12–19,
doi:10.1145/1159876.1159880.
Koichi Fujima, Sohei Ito & Naoki Kobayashi (2013):
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes.
In: Programming Languages and Systems - 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013. Proceedings,
pp. 17–32,
doi:10.1007/978-3-319-03542-0_2.
Georges Gonthier, Martín Abadi & Jean-Jacques Lévy (1992):
The Geometry of Optimal Lambda Reduction.
In: Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '92.
ACM,
New York, NY, USA,
pp. 15–26,
doi:10.1145/143165.143172.
Jean Goubault (1993):
Implementing Functional Languages with Fast Equality Sets and Maps: an Exercise in Hash Cons.
In: Journées Francophones des Langages Applicatifs (JFLA'93),
Annecy,
pp. 222–238.
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong & Olivier Serre (2008):
Collapsible Pushdown Automata and Recursion Schemes.
In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA,
pp. 452–461,
doi:10.1109/LICS.2008.34.
John Lamping (1990):
An Algorithm for Optimal Lambda Calculus Reduction.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '90.
ACM,
New York, NY, USA,
pp. 16–30,
doi:10.1145/96709.96711.
Martin Lange & Étienne Lozes (2014):
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic.
In: Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings,
pp. 90–103,
doi:10.1007/978-3-662-44602-7_8.
Olivier Laurent (2002):
Etude de la polarisation en logique.
Thèse de doctorat.
Université Aix-Marseille II.
Ian Mackie (1998):
YALE: Yet Another Lambda Evaluator Based on Interaction Nets.
In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming,
ICFP '98.
ACM,
New York, NY, USA,
pp. 117–128,
doi:10.1145/289423.289434.
A. N. Maslov. (1976):
Multilevel stack automata.
Problems of Information Transmission 12,
pp. 38–43.
Sylvain Salvati & Igor Walukiewicz (2014):
Krivine machines and higher-order schemes.
Inf. Comput. 239,
pp. 340–355,
doi:10.1016/j.ic.2014.07.012.
Taku Terao & Naoki Kobayashi (2014):
A ZDD-Based Efficient Higher-Order Model Checking Algorithm.
In: Programming Languages and Systems - 12th Asian Symposium, APLAS 2014, Singapore, November 17-19, 2014, Proceedings,
pp. 354–371,
doi:10.1007/978-3-319-12736-1_19.
Mahesh Viswanathan & Ramesh Viswanathan (2004):
A Higher Order Modal Fixed Point Logic.
In: Ph. Gardner & N. Yoshida: CONCUR,
Lecture Notes in Computer Science 3170.
Springer,
pp. 512–528,
doi:10.1007/978-3-540-28644-8_33.
eptcs@eptcs.org