424 search results - page 33 / 85 » A Lambda Calculus with Forms |
CASCON
1996
13 years 9 months ago
1996
This paper describes the use of WatIF, a simple compiler intermediate form based on the -calculus, for writing compiler front-ends for a wide range of programming languages. Somew...
ENTCS
2002
13 years 7 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
DOCENG
2003
ACM
14 years 24 days ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
POPL
1999
ACM
13 years 12 months ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...