234 search results - page 16 / 47 » Ruler: Programming Type Rules |
ASP
2001
Springer
14 years 6 days ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
TYPES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
ACL
2004
13 years 9 months ago
2004
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
IFL
2001
Springer
14 years 4 days ago
2001
Springer
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...