429 search results - page 73 / 86 » Polymorphic typed defunctionalization |
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...