Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Models of LCF.
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Collapsible Pushdown Automata and Recursion Schemes
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Algebraic families of interpretations
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Types and higher-order recursion schemes for verification of higher-order programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Applications of infinitary lambda calculus
Information and Computation
Recognizability in the Simply Typed Lambda-Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Krivine machines and higher-order schemes
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Higher-Order Model Checking: From Theory to Practice
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Significance of the Collapse Operation
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Loader and urzyczyn are logically related
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Higher-order recursive schemes are abstract forms of programs where the meaning of built-in constructs is not specified. The semantics of a scheme is an infinite tree labeled with built-in constructs. The research on recursive schemes spans over more than forty years. Still, central problems like the equality problem, and more recently, the model checking problem for schemes remain very intriguing. Even though recursive schemes were originally though of as a syntactic simplification of a fragment of the lambda calculus, we propose to go back to lambda calculus to study schemes. In particular, for the model checking problem we propose to use standard finitary models for the simply-typed lambda calculus.