53 search results - page 7 / 11 » Partial Evaluation for the Lambda Calculus |
ICCL
1998
IEEE
13 years 11 months ago
1998
IEEE
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
DAGSTUHL
1996
13 years 8 months ago
1996
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
PEPM
1994
ACM
13 years 11 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
LACL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...