254 search results - page 14 / 51 » Qualified Computations in Functional Logic Programming |
PLILP
1997
Springer
14 years 3 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
VSTTE
2012
Springer
12 years 6 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
DIS
2006
Springer
14 years 2 months ago
2006
Springer
Protein domains are the building blocks of proteins, and their interactions are crucial in forming stable protein-protein interactions (PPI) and take part in many cellular processe...
BMCBI
2011
13 years 5 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
JFP
2000
13 years 10 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...