• Publications
  • Influence
Using history of mathematics in the teaching and learning of mathematics in Singapore
In this paper, we consider the use of history of mathematics as a methodology in the teaching and learning of mathematics in Singapore, in particular at the polytechnic and junior college level. MoreExpand
  • 17
  • 6
  • PDF
A Category Theoretical Argument against the Possibility of Artificial Life: Robert Rosen's Central Proof Revisited
One of Robert Rosen's main contributions to the scientific community is summarized in his book Life itself. There Rosen presents a theoretical framework to define living systems; given thisExpand
  • 36
  • 4
  • PDF
Lattices of Scott-closed sets
A dcpo $P$ is continuous if and only if the lattice $C(P)$ of all Scott-closed subsets of $P$ is completely distributive. However, in the case where $P$ is a non-continuous dcpo, little is knownExpand
  • 19
  • 4
  • PDF
Concrete-Pictorial-Abstract: Surveying its origins and charting its future
The Concrete-Pictorial-Abstract (CPA) approach, based on Bruner's conception of the enactive, iconic and symbolic modes of representation, is a well-known instructional heuristic advocated by theExpand
  • 31
  • 3
  • PDF
Operational Domain Theory and Topology of a Sequential Programming Language
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this, and, moreover, weExpand
  • 15
  • 1
  • PDF
Computational Realizations of Living Systems
Robert Rosen's central theorem states that organisms are fundamentally different from machines, mainly because they are closed with respect to effcient causation. The proof for this theorem rests onExpand
  • 16
  • PDF
The Localization Hypothesis and Machines
In a recent article in Artificial Life, Chu and Ho suggested that Rosen's central result about the simulability of living systems might be flawed. This argument was later declared null and void byExpand
  • 17
  • PDF
On topologies defined by irreducible sets
Abstract In this paper, we define and study a new topology constructed from any given topology on a set, using irreducible sets. The manner in which this derived topology is obtained is inspired byExpand
  • 22
  • PDF
The Ho-Zhao Problem
Given a poset $P$, the set, $\Gamma(P)$, of all Scott closed sets ordered by inclusion forms a complete lattice. A subcategory $\mathbf{C}$ of $\mathbf{Pos}_d$ (the category of posets andExpand
  • 12
  • PDF
Operational domain theory and topology of a sequential programming language
  • M. Escardó, Weng Kin Ho
  • Computer Science, Mathematics
  • 20th Annual IEEE Symposium on Logic in Computer…
  • 1 March 2009
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this, and, moreover, weExpand
  • 7
  • PDF