Sciweavers

1805 search results - page 213 / 361
» Functional programming with structured graphs
Sort
View
ICFP
2003
ACM
16 years 1 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
POPL
2010
ACM
15 years 11 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
ASPLOS
2008
ACM
15 years 3 months ago
Xoc, an extension-oriented compiler for systems programming
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, ...
Russ Cox, Tom Bergan, Austin T. Clements, M. Frans...
ICSE
2004
IEEE-ACM
16 years 1 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun
FPCA
1995
15 years 5 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin