71 search results - page 11 / 15 » Complete Cuboidal Sets in Axiomatic Domain Theory |
RTA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
94
Voted
FPCA
1989
15 years 2 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
81
Voted
LOGCOM
2000
14 years 10 months ago
2000
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
106
Voted
SIGIR
2012
ACM
13 years 21 days ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
102
Voted
ASE
2005
14 years 10 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...