Sciweavers

4438 search results - page 209 / 888
» The Case for Collaborative Programming
Sort
View
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
15 years 10 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
WCRE
2000
IEEE
15 years 10 months ago
Reverse Engineering from Assembler to Formal Specifications via Program Transformations
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...
Martin P. Ward
ACL
2006
15 years 8 months ago
Constraint-Based Sentence Compression: An Integer Programming Approach
The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an o...
James Clarke, Mirella Lapata
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
ENTCS
2008
119views more  ENTCS 2008»
15 years 6 months ago
An Example of Cloning Graph Transformation Rules for Programming
Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of grap...
Mark Minas, Berthold Hoffmann