Semantics, Applications, and Implementation of Program Generation

Invited Talks.- Generative Programming and Software System Families.- Accomplishments and Research Challenges in Meta-programming.- A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming.- Technical Papers.- Short Cut Fusion: Proved and Improved.- Generation of Efficient Programs for Solving Maximum Multi-marking Problems.- Static Transition Compression.- A Unifying Approach to Goal-Directed Evaluation.- Integrating Partial Evaluators into Interpreters.- A Design Methodology for Functional Programs.- Dynamically Adaptable Software with Metacomputations in a Staged Language.- Position Papers.- MetaKlaim: Meta-programming for Global Computing.- A Transformational Approach which Combines Size Inference and Program Optimization.

[1]  Pierre Jouvelot,et al.  The type and effect discipline , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2]  R. Bird.  Introduction to functional programming using Haskell, Second Edition , 1998 .

[3]  Richard S. Bird,et al.  Algebraic Identities for Program Calculation , 1989, Comput. J..

[4]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[5]  Johan Jeuring.  Theories for Algorithm Calculation , 1993 .

[6]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[7]  Richard S. Bird,et al.  An introduction to the theory of lists , 1987 .

[8]  Oege de Moor.  A Generic Program for Sequential Decision Processes , 1995, PLILP.

[9]  Todd A. Proebsting,et al.  A new implementation of the Icon language , 2000, Softw. Pract. Exp..

[10]  Simon L. Peyton Jones,et al.  A short cut to deforestation , 1993, FPCA '93.

[11]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[12]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.

[13]  Pierre Jouvelot,et al.  Polymorphic type, region and effect inference , 1992, Journal of Functional Programming.

[14]  Oege de Moor,et al.  Generic Program Transformation , 1998, Advanced Functional Programming.

[15]  John C. Reynolds,et al.  Definitional Interpreters for Higher-Order Programming Languages , 1972, ACM '72.

[16]  Frits C. R. Spieksma,et al.  Simple Algorithms for a Weighted Interval Selection Problem , 2000, ISAAC.

[17]  Philip Wadler.  Monads for Functional Programming , 1995, Advanced Functional Programming.

[18]  Peter Lee,et al.  Optimizing ML with run-time code generation , 1996, PLDI '96.

[19]  Karoline Malmkjær.  Abstract interpretation of partial evaluation algorithms , 1993 .

[20]  Philip Wadler,et al.  Combining Monads , 1992 .

[21]  Mizuhito Ogawa,et al.  Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems , 2000, ICFP '00.

[22]  Maarten M. Fokkinga,et al.  Law and order in algorithmics , 1992 .

[23]  Akihiko Takano,et al.  Tupling calculation eliminates multiple data traversals , 1997, ICFP '97.

[24]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .