Sciweavers

2373 search results - page 14 / 475
» On the Theory of Structural Subtyping
Sort
View
IS
2006
14 years 9 months ago
Composition of Semantic Web services using Linear Logic theorem proving
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)...
Jinghai Rao, Peep Küngas, Mihhail Matskin
CADE
1990
Springer
15 years 1 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
ENTCS
2008
116views more  ENTCS 2008»
14 years 9 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
15 years 3 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers
69
Voted
JOLLI
2010
92views more  JOLLI 2010»
14 years 8 months ago
A Theory of Hierarchical Consequence and Conditionals
We introduce A-ranked preferential structures and combine them with an accessibility relation. A-ranked preferential structures are intermediate between simple preferential struct...
Dov M. Gabbay, Karl Schlechta