Recognizability in the Simply Typed Lambda-Calculus

Authors:
Sylvain Salvati
Affiliations:
INRIA Bordeaux --- Sud-Ouest, Talence cedex, France 33405
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 7
Cited 7

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Higher-Order Matching and Tree Automata

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

Journal of Logic, Language and Information
Towards abstract categorial grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On Model-Checking Trees Generated by Higher-Order Recursion Schemes

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
A game-theoretic approach to deciding higher-order matching

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

The Logic of Persistent Intersection

Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Finite combinatory logic with intersection types

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
An alternate proof of Statman's finite completeness theorem

Information Processing Letters
The complexity of inhabitation with explicit intersection

Logic and Program Semantics
Loader and urzyczyn are logically related

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Simple models for recursive schemes

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The IO and OI hierarchies revisited

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a notion of recognizable sets of simply typed *** -terms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for *** -terms. We then expose the closure properties of this notion and present some of its applications.