239 search results - page 37 / 48 » Partial Evaluation of Functional Logic Programs |
APLAS
2010
ACM
13 years 10 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
IFL
2005
Springer
14 years 3 months ago
2005
Springer
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 ...
ERSHOV
1989
Springer
14 years 1 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
BMCBI
2004
13 years 9 months ago
2004
Background: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern search...
APAL
2008
13 years 10 months ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....