Sciweavers

1071 search results - page 30 / 215
» Programming with enumerable sets of structures
Sort
View
PASTE
1999
ACM
14 years 3 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam
ECOOP
2012
Springer
12 years 1 months ago
Static Detection of Loop-Invariant Data Structures
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
Guoqing (Harry) Xu, Dacong Yan, Atanas Rountev
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 11 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 3 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
ICFP
2005
ACM
14 years 11 months ago
An expressive language of signatures
Current languages allow a programmer to describe an interface only by enumerating its parts, possibly including other interfaces wholesale. Such languages cannot express relations...
Norman Ramsey, Kathleen Fisher, Paul Govereau