2000 search results - page 112 / 400 » Program Transformation and Proof Transformation |
130
Voted
ECOOPW
1998
Springer
15 years 7 months ago
1998
Springer
In restructuring legacy code it may be useful to introduce a design pattern in order to add clarity to the system and thus facilitate further program evolution. We show that aspec...
156
click to vote
PEPM
2012
ACM
13 years 11 months ago
2012
ACM
We share a vision of connecting the topics of bidirectional transformation and inductive program synthesis, by proposing to use the latter in approaching problematic aspects of th...
129
Voted
GPCE
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
110
Voted
APLAS
2004
ACM
15 years 8 months ago
2004
ACM
Parallel programming is becoming an important cornerstone of general computing. In addition, type systems have significant impact on program analysis. In this paper, we demonstrat...
114
Voted
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...