Preface. Contributing authors. 1: Playful, streamlike computation; P.-L. Curien. 1. Prologue: playing with Böhm trees. 2. Introduction. 3. Symmetric algorithms, sequential algorithms. 4. Related works. 5. Control. 6. A few more remarks. 2: Universal types and what they are good for; J.R. Longley. 1. Universal objects. 2. lambda-algebras. 3. Denotational semantics. 4. Universal types. 5. Syntax and semantics of PCF. 6. Examples of universal types. 7. Conclusions and further directions. 3: Relational representations of hyper-continuous lattices; Xiao-Quan Xu, Ying-Ming Liu. 1. Preliminaries. 2. Regular representations of completely distributive lattices. 3. Finitely regular representations of hyper-continuous lattices. 4: Convergence classes and spaces of partial functions; A.K. Seda, R. Heinze, P. Hitzler. 1. Introduction. 2. Convergence spaces and convergence classes. 3. Convergence classes and VDM. 4. Compactness of (X --> Y). 5. Conclusions and further work. 5: On meet-continuous dcpos; Hui Kou, Ying-Ming Liu, Mao-Kang Luo. 1. Introduction. 2. Basic properties of meet-continuous dcpos. 3. Dcpos with the Hausdorff Lawson topology. 4. Adjunctions between quasicontinuous domains and continuous domains. 5. Scott-open filters. 6. Concluding remarks. 6: External characterizations of continuous sL-domains; LuoshanXu. 1. Introduction. 2. Preliminaries. 3. Continuous sL-domains and their characterizations by function spaces. 4. External characterizations by posets of ideals. 7: Projectives and injectives in the category of quantales; Yong-Ming Li, Meng Zhou. 1. Introduction. 2. Regular projectives in the category of quantales. 3. Injective objects in the category of quantales. 8: On minimal event and concrete data structures; F. Bracho, M. Droste, I. Meinecke. 1. Introduction. 2. Event structures, concrete data structures and their domains. 3. Congruences on prime intervals and associated structures. 4. Maximal and minimal structures. 5. Conclusion. 9: A note on strongly finite sequent structures; D. Spreen, R. Greb. 1. Introduction. 2. Basic definitions and results. 3. Domain constructions. 4. Strongly finite sequent structures. 5. Sequent structures and preorders. 6. Constructions on preorders. 7. Conclusion.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata