Extending Algebraic Operations to D-Completions
暂无分享,去创建一个
[1] Klaus Keimel,et al. D-completions and the d-topology , 2009, Ann. Pure Appl. Log..
[2] H. Herrlich,et al. Category theory at work , 1991 .
[3] Michael W. Mislove,et al. Monoids over domains , 2006, Mathematical Structures in Computer Science.
[4] S. Maclane,et al. Categories for the Working Mathematician , 1971 .
[5] Yuri Leonidovich Ershov,et al. Theory of Domains and Nearby (Invited Paper) , 1993, Formal Methods in Programming and Their Applications.
[6] George Grätzer,et al. Identities for globals (complex algebras) of algebras , 1988 .
[7] Yuri Leonidovich Ershov,et al. The Bounded-Complete Hull of an Alpha-Space , 1997, Theor. Comput. Sci..
[8] Samson Abramsky,et al. Domain theory , 1995, LICS 1995.
[9] Glynn Winskel,et al. Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.
[10] Zoltán Ésik,et al. Scott induction and equational proofs , 1995, MFPS.
[11] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.
[12] Jimmie D. Lawson. T0-spaces and pointwise convergence , 1985 .
[13] Michael B. Smyth,et al. Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.
[14] N. D. Gautam. The validity of equations of complex algebras , 1957, Arch. Math. Log..
[15] Klaus Keimel,et al. Topological cones: functional analysis in a T0-setting , 2008 .
[16] K. Hofmann,et al. Continuous Lattices and Domains , 2003 .
[17] Matthias Schröder,et al. Compactly generated domain theory , 2006, Mathematical Structures in Computer Science.
[18] Steven J. Vickers,et al. Presenting Dcpos and Dcpo Algebras , 2008, MFPS.