校园生活
当前位置: 首页 >> 校园生活 >> 学术活动 >> 学院讲座 >> 正文
统计数据 / lectrue notice
  • 排序 学院 发文量
    1 物理与微电子科学学院 29
    2 化学化工学院 28
    3 电气与信息工程学院 26
    4 机械与运载工程学院 15
    5 外国语学院 13
    6 经济与贸易学院 12
    7 数学与计量经济学院 12
    8 工商管理学院 10
    9 法学院 9
    10 材料科学与工程学院 8
  • 排序 学院 发文量
    11 信息科学与工程学院 7
    12 经济与管理研究中心 5
    13 中国语言文学学院 4
    14 教务处 3
    15 土木工程学院 3
    16 新闻传播与影视艺术学院 2
    17 建筑学院 2
    18 生物学院 2
    19 金融与统计学院 1
数学院:Non-Hausdorff Topology
学术地点 数学院425 主讲人 Prof. Ho Weng Kin
讲座时间 2017.11.20-11.23,上午9:00-12:00

Speaker: Prof. Ho Weng Kin

Title: Non-Hausdorff Topology

报告时间:2017.11.20-11.23,上午9:00-12:00

地点:数学院425

Abstract:

For many people working with topology, especially those in the fields of real analysis and functional analysis, a separation weaker than T2 would commonly be accepted as exoteric, if not, function no more than a passing counterexample. However, recent years saw the development of domain theory which has key applications in computer science, and this important development opened up the field of non-Hausdorff topology. Indeed I subscribe to the Jean Goubault-Larrecq’s slogan which he puts in his book (Non-Hausdorff Topology and Domain Theory): “Domain Theory is Topology done right”.

In a series of four lectures, I would attempt to touch on domain theory and non-Hausdorff topology, making connections between these. Because of the breadth and depth of this field, what I do has to be very selective. The journey begins by looking retrospectively at D. S. Scott’s motivation of domains as an approximation structure for the denotational semantics of untyped lambda calculus. Key features here include the way-below relation and hence the notion of a continuous dcpo, i.e., a domain, and of course the Scott topology. There are always two-sides of the domain-theoretic coin: the order-theoretic side, and the topological side. Two main results will be mentioned to shed light on the links between these two sides, i.e., one that characterizes the continuous lattices in their Scott topology as the injective T0 spaces, and the other one the Scott Convergence Theorem. Other categorical aspects on the order-theoretic side will be mentioned, particularly, some notable dualities and equivalences. In the passing, we shall scrape the surface of recursive domain equations, allowing us to come back to our initial semantical motivation. Interesting properties of the Scott topology will be touched upon in this course in relation to continuous dcpo’s, e.g., sobriety of the Scott topology. Sober spaces will be a very important point of our four-day discussion.

The special feature in this lecture series is my attempt to raise to the audience’s attention some research areas in domain theory that can be followed up, especially amongst the younger generation of domain-theorists. Achim Jung once remarked that in domain theory the easy problems have all been solved, and the ones of medium difficulty were also more or less settled; what remain now are the hard ones – and they are really hard. Open questions, together with recent development, will be ‘sprinkled’ along the way to entice young minds to have a go at them! Alongside with the development of the lecture will be frequent mention of my own view of research methodology that, I hope, is useful to the audience.

Short biography of Professor Ho Weng Kin

HO Weng Kin received his Ph.D. in Computer Science from The University of Birmingham (UK) in 2006. His doctoral thesis proposed an operational domain theory for sequential functional programming languages. He specializes in programming language semantics and is dedicated to the study of hybrid semantics and their applications in computing. Notably, he solved the open problem that questions the existence of a purely operationally-based proof for the well-known minimal invariance theorem of (nested) recursive types in Fixed Point Calculus. His research interests also include domain theory, exact real arithmetic, category theory, algebra, real analysis and applications of topology in computation theory.

Research interest

His research interests in mathematics and computer science include domain theory, exact real arithmetic, category theory, algebra, real analysis, applications of topology in computation theory and computer science education.

His research interests in mathematics education include the use of computer and video technology in the teaching and learning of mathematics, flipped classroom pedagogy, mathematics problem solving, computational thinking.

何永坚教授简历

何永坚于2006年在英国伯明翰大学获得(计算机科学)博士学位。他的博士论文提出了顺序函数式编程语言的运算域理论。他擅长编程语言语义,致力于研究混合语义及其在计算中的应用。值得注意的是,他具体地提供了定点演算(FPC)递归类型的最小不变性定理的纯操证明,解决了一个公开问题。他的研究兴趣还包括域论(DOMAIN THEORY),精确实数算法,范畴论,代数,分析和计算理论中拓扑的应用。

研究兴趣

他在数学和计算机科学方面的研究兴趣包括域论,精确实数算法,范畴论,代数,分析,拓扑学在计算理论的应用以及计算机科学教育。

他在数学教育方面的研究兴趣包括计算机和视频技术在数学教学中的应用,翻转课堂教学法,数学问题解决,计算思维等。


上一条:材料院:Seek, Destroy and Heal: Enzyme-Responsive Nanoparticles as In Vivo Targeted Delivery Systems
下一条:物电院:极端条件下原子尺度材料特性研究

湖大官网
湖大微信
湖大微博