Sciweavers

7430 search results - page 602 / 1486
» Programming Applications in CIFF
Sort
View
ERSHOV
2009
Springer
16 years 1 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko
ICSM
2006
IEEE
16 years 1 months ago
Dynamic Updating of Software Systems Based on Aspects
Long-running applications such as network services require continuous uptime but also frequent changes to the software. To avoid downtime for software maintenance, applications mu...
Susanne Cech Previtali, Thomas R. Gross
ECOOP
2005
Springer
16 years 21 days ago
Towards a Meta-Modelling Approach to Configurable Middleware
Abstract. In our research we are studying how to combine modelling, metamodelling, and reflection to systematically generate middleware configurations that can be targeted at diffe...
Nelly Bencomo, Gordon S. Blair, Geoff Coulson, Tha...
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
16 years 20 days ago
The Implementation of iData
The iData Toolkit is a toolkit that allows programmers to create interactive, type-safe, dynamic web applications with state on a high level of abstraction. The key element of this...
Rinus Plasmeijer, Peter Achten
PPDP
2005
Springer
16 years 20 days ago
A new calculus of contexts
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...
Murdoch Gabbay