Regular Böhm trees

Authors:
Gérard Huet
Affiliations:
INRIA-Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France. Email: Gerard.Huet@inria.fr
Venue:
Mathematical Structures in Computer Science
Year:
1998

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
A co-induction principle for recursively defined domains

Theoretical Computer Science
Finite-State Transducers as Regular Böhm Trees

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Codifying Guarded Definitions with Recursive Schemes

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs

Hi-index	0.00

We give a decision procedure for the extensional equality of total Böhm trees presented by regular systems of recursion equations.