86 search results - page 17 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
CTCS
1989
Springer
13 years 9 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
ICEIS
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...