53 search results - page 9 / 11 » Partial Evaluation for the Lambda Calculus |
TACS
1994
Springer
13 years 11 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
TLDI
2005
ACM
14 years 29 days ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
AAAI
1993
13 years 8 months ago
1993
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...