Sciweavers

1989 search results - page 145 / 398
» Set functions for functional logic programming
Sort
View
EKAW
2008
Springer
15 years 5 months ago
On the Influence of Description Logics Ontologies on Conceptual Similarity
Similarity measures play a key role in the Semantic Web perspective. Indeed, most of the ontology related operations such as ontology learning, ontology alignment, ontology ranking...
Claudia d'Amato, Steffen Staab, Nicola Fanizzi
ICSE
1999
IEEE-ACM
15 years 7 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
15 years 8 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
CSL
2006
Springer
15 years 7 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
APLAS
2009
ACM
15 years 9 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata