Sciweavers

5090 search results - page 275 / 1018
» Constructing Strategies for Programming
Sort
View
163
Voted
PASTE
1999
ACM
15 years 9 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam
POPL
2006
ACM
16 years 5 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
ICFP
2003
ACM
16 years 4 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 11 months ago
Exploring medical data using visual spaces with genetic programming and implicit functional mappings
Two medical data sets (Breast cancer and Colon cancer) are investigated within a visual data mining paradigm through the unsupervised construction of virtual reality spaces using ...
Julio J. Valdés, Robert Orchard, Alan J. Ba...
POPL
2005
ACM
16 years 5 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela