31 search results - page 3 / 7 » Disentangling Denotational Semantics Definitions |
TACS
1994
Springer
13 years 9 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
ESWS
2008
Springer
13 years 6 months ago
2008
Springer
When a Semantic Web application encounters a new URI in an RDF statement, how should it determine what resource that URI is intended to denote, and learn more about it? Since asser...
ICFP
2004
ACM
14 years 4 months ago
2004
ACM
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we present a simple database definition language: that of categories and functors. A database schema is a category and a state is a set-valued functor. We show that m...
ACSD
1998
IEEE
13 years 9 months ago
1998
IEEE
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...