Author:
Abramsky Samson,Jung Achim
Abstract
Abstract
Let us begin with the problems which gave rise to domain theory: Least fixpoints as meanings of recursive definitions. Recursive definitions of procedures, data structures and other computational entities abound in programming languages. Indeed, recursion is the basic effective mechanism for describing infinite computational behaviour in finite terms.
Publisher
Oxford University PressOxford
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Cartesian Closed Category for Random Variables;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Relevance implication and orthomodular posets;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28
3. Ideal presentations and numberings of some classes of effective quasi-Polish spaces;Computability;2024-01-29
4. A construction of free dcpo-cones;Mathematical Structures in Computer Science;2024-01
5. Monadic Intersection Types, Relationally;Lecture Notes in Computer Science;2024