Sciweavers

3020 search results - page 3 / 604
» Type Analysis of Prolog Using Type Graphs
Sort
View
ECLIPSE
2005
ACM
13 years 9 months ago
Building a whole-program type analysis in Eclipse
Eclipse has the potential to become a widely-used platform for implementation and dissemination of various static analyses for Java. In order to realize this potential, it is impo...
Mariana Sharp, Jason Sawin, Atanas Rountev
BCB
2010
166views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
ICFP
2001
ACM
14 years 7 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
EACL
2003
ACL Anthology
13 years 9 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn