Publications of Maurizio Proietti

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  1996, with author Proietti M., in the category Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 6)

1996  [top]
  • Pettorossi A., Maurizio Proietti: A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties, in the Proceedings of Dagstuhl Seminar on Partial Evaluation, Thiemann P., Danvy O., Glück R. eds., Lecture Notes in Computer Science, 1110, 1996
  • Pettorossi A., Maurizio Proietti: A Comparative Revisitation of Some Program Transformation Techniques, in the Proceedings of Dagstuhl Seminar on Partial Evaluation., Thiemann P., Danvy O., Glück R. eds., Lecture Notes in Computer Science, 1110, 1996
  • Pettorossi A., Maurizio Proietti: Rules and Strategies for Transforming Functional and Logic Programs, ACM Computing Surveys 28 (2), 360-414, 1996
  • Pettorossi A., Maurizio Proietti: Developing Correct and Efficient Logic Programs by Transformation, Knowledge Engineering Review 11 (4), 347-360, 1996
  • Pettorossi A., Maurizio Proietti, Renault S.: How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification, in the Proceedings of Joint International Conference and Symposium on Logic Programming, Bonn, Germany, Maher M. ed., Logic Programming Series, 1996
  • Pettorossi A., Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, Proceedings LOPSTR '96, Stockholm, Sweden., Gallagher J. ed., 101-112, 1996
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -