Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Hing-Kai Hung

dblp:38/6287 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › formal semantics
compositional semantics
0.011991
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic · LICS 1991
Logic in computer science
intensional logic
0.011991
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic · LICS 1991
Logic in computer science
program semantics
0.011991
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic · LICS 1991

Methods — techniques the papers use, named apart from their topics

possible worlds semantics · 0.0intensional logic · 0.0
YearPublicationVenuePosition
1993 Querying and Exploring Large Knowledge Bases
Hing-Kai Hung, Patrick Martin 0001, Janice I. Glasgow, Chris Walmsley, Michael A. Jenkins
DEXA1
1992 Supporting Browsing of Large Knowledge Bases
Patrick Martin 0001, Hing-Kai Hung, Chris Walmsley
DEXA2
1991 Semantics of Pointers, Referencing and Dereferencing with Intensional Logic
abstract
Intensional logic is applied to the semantics of an Algol-like programming language. This approach associates with expressions their senses, or meanings relative to possible worlds, here interpreted as machine states. These meanings lie in the semantic domains of a higher order typed intensional logic. The advantage of the approach is that it preserves compositionality of the meaning function, even in opaque contexts. This study extends earlier work in this direction, by T.M.V. Janssen and P. Van Emde Boas (1977), to pointers, including dereferenced pointers on both sides of assignments. It is shown how this approach gives an elegant solution to the problem of pointer semantics which is simple, compositional, and implementation independent.>
Hing-Kai Hung, Jeffery I. Zucker
LICS1