- Higher-Order Timed Automata and Tail Recursion Florian Bruse Tue 11 November 2025
- A Type System Describing Unboundedness Paweł Parys Thu 25 May 2023
- Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys Tue 18 April 2023
- Recursion Schemes and Logical Reflection C.H. Broadbent A. Carayol C.-H.L. Ong O. Serre Wed 12 August 2020
- A Type System Describing Unboundedness Pawel Parys Tue 04 December 2018
- Collapsible Pushdown Automata and Recursion Schemes Matthew Hague Andrzej S. Murawski C.-H. Luke Ong Olivier Serre Tue 22 May 2018
- On the Relationship Between Higher-order Recursion Schemes and Higher-order Fixpoint Logic Naoki Kobayashi Étienne Lozes Florian Bruse Tue 11 April 2017
- Finitary semantics of linear logic and higher-order model-checking Charles Grellois Paul-André Melliès Thu 04 June 2015
- Schemes with recursion on higher types K. Indermark Tue 10 December 2013
- Model-Checking Higher-Order Recursion Schemes Ligia Nicoleta Nistor Thu 02 May 2013
- PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE N/A Thu 02 May 2013
- A traversal-based algorithm for higher-order model checking Robin P. Neatherway Steven J. Ramsay Chih-Hao Luke Ong Wed 01 May 2013
- Model-Checking Higher-Order Programs with Recursive Types Naoki Kobayashi Atsushi Igarashi Tue 16 April 2013
- IO vs OI in Higher-Order Recursion Schemes Axel Haddad Wed 27 March 2013
- Functional programs as compressed data Naoki Kobayashi Kazutaka Matsuda Ayumi Shinohara Sat 02 March 2013
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes C. Ong Takeshi Tsukada Mon 18 February 2013
- Model Checking Liveness Properties of Higher-Order Functional Programs M. Lester R. Neatherway C. -H. L. Ong S. Ramsay Wed 30 January 2013
- Higher-order multi-parameter tree transducers and recursion schemes for program verification Naoki Kobayashi Naoshi Tabuchi Hiroshi Unno Wed 30 January 2013
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Naoki Kobayashi C.-H. Luke Ong Mon 28 January 2013
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes Naoki Kobayashi Mon 28 January 2013
- Untyped Recursion Schemes and Infinite Intersection Types Takeshi Tsukada Naoki Kobayashi Mon 28 January 2013
- Types and Recursion Schemes for Higher-Order Program Verification Naoki Kobayashi Mon 28 January 2013
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Naoki Kobayashi C. Ong Mon 28 January 2013
- Verifying higher-order functional programs with pattern-matching algebraic data types C.-H. Luke Ong Steven James Ramsay Mon 28 January 2013
- A finite semantics of simply-typed lambda terms for infinite runs of automata Klaus Aehlig Mon 28 January 2013
- Types and higher-order recursion schemes for verification of higher-order programs Naoki Kobayashi Mon 28 January 2013
- Structures Generated by Higher-Order Grammars and the Safety Constraint Jolie G. de Miranda Fri 14 December 2012
- Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata Sylvain Salvati Igor Walukiewicz Thu 20 September 2012
- Collapsible Pushdown Automata and Labeled Recursion Schemes - Equivalence, Safety and Effective Selection Arnaud Carayol Olivier Serre Fri 10 August 2012
- A Saturation Method for Collapsible Pushdown Systems Chris Broadbent Arnaud Carayol Matthew Hague Olivier Serre Tue 03 July 2012
- Strictness of the Collapsible Pushdown Hierarchy Alexander Kartzow Paweł Parys Tue 05 June 2012
- A Pumping Lemma for Pushdown Graphs of Any Level Pawel Parys Tue 05 June 2012
- Second-Order Simple Grammars Colin Stirling Fri 27 April 2012
- An introduction to decidability of higher-order matching Colin Stirling Thu 26 April 2012
- Deciding monadic theories of hyperalgebraic trees Teodor Knapik Damian Niwinski Paweł Urzyczyn Thu 12 April 2012
- Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata Pawel Parys Tue 06 March 2012
- Collapsible Pushdown Graphs of Level 2 are Tree-Automatic Alexander Kartzow Tue 06 March 2012
- Winning Regions of Higher-Order Pushdown Games A. Carayol M. Hague A. Meyer C.-H.L. Ong O. Serre Tue 06 March 2012
- A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes Naoki Kobayashi C.-H. Luke Ong Tue 06 March 2012
- Safety Is not a Restriction at Level 2 for String Languages K. Aehlig J. G. de Miranda C. -H. L. Ong Tue 06 March 2012
- Unsafe grammars and panic automata Teodor Knapik Damian Niwiński Paweł Urzyczyn Igor Walukiewicz Tue 06 March 2012
- Krivine Machines and Higher-Order Schemes S. Salvati I. Walukiewicz Tue 06 March 2012
- On Model-Checking Trees Generated by Higher-Order Recursion Schemes C.-H. L. Ong Tue 06 March 2012
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes Christopher Broadbent Luke Ong Tue 06 March 2012
- Collapsible Pushdown Automata and Recursion Schemes M. Hague A. S. Murawski C.-H. L. Ong O. Serre Tue 06 March 2012
- Higher-Order Pushdown Trees Are Easy Teodor Knapik Damian Niwiński Paweł Urzyczyn Tue 06 March 2012
- The IO- and OI-hierarchies Werner Damm Tue 06 March 2012
Library Size: 13G (47 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
