Publications of Alberto Pettorossi
|
|
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
1997, with author Pettorossi A., in the category ALL
(or show them all): (Items found: 6)
1997 [top]
- Pettorossi A., Maurizio Proietti: Future Directions in Program Transformation, in the Proceedings of Workshop on Strategic Directions in Computing Research, MIT, Cambridge, USA, SIGPLAN Notices, 32/1, ACM Press, 99-102, 1997
- Pettorossi A., Maurizio Proietti: Program Derivation via List Introduction, in the Proceedings of IFIP TC2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, Bird R., Meertens L.G.L.T. eds., Chapman \& Hall, 296-323, 1997
- Pettorossi A., Maurizio Proietti: Flexible Continuations in Logic Programs via Unfold/Fold Transformations and Goal Generalization, in the Proceedings of 2nd ACM SIGPLAN Workshop on Continuations, ENS, Paris, France, Danvy O. ed., BRICS Notes Series, N6-93-13, 1997
- Pettorossi A., Maurizio Proietti: Synthesis and transformation of logic programs using unfold/fold proofs, IASI-CNR, R. 457, 06/1997
- Pettorossi A., Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, 6th International Workshop, Stockholm, Sweden, Gallagher J. ed., Lecture Notes in Computer Science, 1207, Springer-Verlag, 147-168, 1997
- Pettorossi A., Maurizio Proietti, Renault S.: Reducing Nondeterminism while Specializing Logic Programs, in the Proceedings of 24th ACM Symposium on Principles of Programming Languages, La Sorbonne, Paris, France, SIGPLAN Notices, 1997
|
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|