Affiliation:
1. Laboratoire d’ Informatique, Université de Poitiers
2. University of Paris VII
Abstract
The set of infinite trees is considered as an ultrametric compact space. The composition of trees is investigated. Applications to non deterministic recursive program schemes are given.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combining fixpoint and differentiation theory;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Soundness of Object-Oriented Languages with Coinductive Big-Step Semantics;ECOOP 2012 – Object-Oriented Programming;2012
3. An Alpha-Corecursion Principle for the Infinitary Lambda Calculus;Coalgebraic Methods in Computer Science;2012
4. Fixing Zeno gaps;Theoretical Computer Science;2011-06
5. Infinitary Combinatory Reduction Systems;Information and Computation;2011-06