365 search results - page 43 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
BMCBI
2005
13 years 7 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. An extension of the λ-calculus is proposed, to study historybased access control. It allows for security policies with a possibly nested, local scope. We define a type ...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
SCP
1998
13 years 7 months ago
1998
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...