358 search results - page 39 / 72 » Parallel Evaluation Strategies for Functional Logic Language... |
148
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
149
click to vote
ESOP
2012
Springer
14 years 1 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
138
click to vote
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Efficient exploitation of the aggregate resources available to a researcher is a challenging and real problem. The challenge becomes all the greater when researchers who collaborat...
161
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
174
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...