111 search results - page 16 / 23 » A Proof of Strong Normalisation using Domain Theory |
SIAMCO
2000
13 years 7 months ago
2000
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
ENTCS
2008
13 years 7 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...
PODS
1997
ACM
13 years 11 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
COCO
2003
Springer
14 years 19 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...