1003 search results - page 97 / 201 » Type Inference with Inequalities |
117
click to vote
LFP
1994
15 years 5 months ago
1994
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
123
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
153
Voted
JSC
2002
15 years 3 months ago
2002
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
185
click to vote
ICWS
2004
IEEE
15 years 5 months ago
2004
IEEE
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
152
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...