Type theories, normal forms, and D∞-lambda-models
Information and Computation
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Handbook of logic in computer science (vol. 1)
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Domains and lambda-calculi
Descendants and origins in term rewriting
Information and Computation - Special issue on RTA-98
Continuous semantics and inside-out reductions
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Infinitary Lambda Calculi and Böhm Models
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Decomposing the lattice of meaningless sets in the infinitary lambda calculus
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Order structures on böhm-like models
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
| Hi-index | 0.00 |
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite and infinite terms with the prefix relation. We prove that the only continuous parametric trees are Böhm and Lévy–Longo trees. We also prove a general statement: if the normal form function is continuous then so is the model induced by the normal form; as well as the converse for parametric trees. This allows us to deduce that the only continuous models induced by the parametric trees are the ones of Böhm and Lévy–Longo trees. As a first application, we prove that there is an injective embedding from the infinitary lambda calculus of the ∞η-Böhm trees in D∞. As a second application, we study the relation between the Scott topology on the prefix relation and the tree topologies. This allows us to prove that the only parametric tree topologies in which all context operators are continuous and the approximation property holds are the ones of Böhm and Lévy–Longo. As a third application, we give an explicit characterisation of the open sets of the Böhm and Lévy–Longo tree topologies.