Sciweavers

1989 search results - page 139 / 398
» Set functions for functional logic programming
Sort
View
LOPSTR
2004
Springer
15 years 8 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
PPDP
2004
Springer
15 years 8 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
ICFP
2005
ACM
16 years 3 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
ECOOP
1999
Springer
15 years 7 months ago
Towards Automatic Specialization of Java Programs
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...
JAVA
1999
Springer
15 years 7 months ago
A Programmer's Reduction Semantics for Classes and Mixins
While class-based object-oriented programming languages provide a flexible mechanism for re-using and managing related pieces of code, they typically lack linguistic facilities fo...
Matthew Flatt, Shriram Krishnamurthi, Matthias Fel...