86 search results - page 6 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
132
Voted
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
120
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
142
Voted
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
122
Voted
POPL
1999
ACM
15 years 8 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...
163
Voted
IS
2008
15 years 3 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...