1882 search results - page 248 / 377 » Transformational Programming and Forests |
139
Voted
SCAM
2002
IEEE
15 years 11 months ago
2002
IEEE
Tools that analyze and enhance large-scale software systems using symbolic reasoning are computationally expensive, and yet processors are cheap. We believe that enabling tools wi...
153
click to vote
GI
2009
Springer
15 years 10 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
162
click to vote
PADO
2001
Springer
15 years 10 months ago
2001
Springer
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
220
click to vote
ECOOP
2000
Springer
15 years 10 months ago
2000
Springer
We have recently shown how use cases can be systematically transformed into UML state charts considering all relevant information from a use case specification, including pre- and ...
180
click to vote
LCR
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...