596 search results - page 54 / 120 » Subtyping Recursive Types |
103
click to vote
WIA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive a...
124
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: A central challenge in the molecular diagnosis and treatment of cancer is to define a set of molecular features that, taken together, distinguish a given cancer, or ty...
128
click to vote
IS
2006
15 years 1 months ago
2006
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
105
click to vote
RTA
1995
Springer
15 years 5 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
106
click to vote
TPHOL
2002
IEEE
15 years 6 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...