@article(ApB91,
 author       = {K.~R. Apt and M.~Bezem},
 year         = {1991},
 title        = {Acyclic Programs},
 journal      = {New Generation Computing},
 volume       = {9},
 pages        = {335--363},
 doi          = {10.1007/BF03037168},
)
@book(Bar84,
 author       = {H.~P. Barendregt},
 year         = {1984},
 title        = {The Lambda Calculus, its Syntax and Semantics},
 publisher    = {North-Holland},
 address      = {Amsterdam},
 doi          = {10.2307/2274112},
)
@inproceedings(BaP75,
 author       = {C.~Batini and A.~Pettorossi},
 year         = {1975},
 title        = {On {S}ubrecursiveness in {W}eak {C}ombinatory {L}ogic},
 booktitle    = {Proceedings of the Symposium $\lambda$-{C}alculus and {C}omputer {S}cience {T}heory},
 series       = {Lecture Notes in Computer Science 37},
 publisher    = {Springer-Verlag},
 pages        = {297--311},
 doi          = {10.1007/BFb0029533},
)
@book(BaW82,
 author       = {F.~L. Bauer and H.~W{\"{o}}ssner},
 year         = {1982},
 title        = {{A}lgorithmic {L}anguage and {P}rogram {D}evelopment},
 publisher    = {Springer-Verlag},
 doi          = {10.1007/978-3-642-61807-9},
)
@article(Bir84b,
 author       = {R.~S. Bird},
 year         = {1984},
 title        = {The Promotion and Accumulation Strategies in Transformational Programming},
 journal      = {{ACM} Toplas},
 volume       = {6},
 number       = {4},
 pages        = {487--504},
 doi          = {10.1145/1780.1781},
)
@article(Bir84a,
 author       = {R.~S. Bird},
 year         = {1984},
 title        = {Using Circular Programs to Eliminate Multiple Traversal of Data},
 journal      = {Acta Informatica},
 volume       = {21},
 pages        = {239--250},
 doi          = {10.1007/BF00264249},
)
@article(BoM75,
 author       = {R.~S. Boyer and J.~S. Moore},
 year         = {1975},
 title        = {Proving Theorems About {L}isp Functions},
 journal      = {Journal of the {ACM}},
 volume       = {22},
 number       = {1},
 pages        = {129--144},
 doi          = {10.1145/321864.321875},
)
@inproceedings(Bur72,
 author       = {R.~Burstall},
 year         = {1972},
 title        = {An {A}lgebraic {D}escription of {P}rograms with {A}ssertions, {V}erification and {S}imulation},
 booktitle    = {Proc. ACM Conference on Proving Assertions about Programs},
 publisher    = {ACM},
 address      = {New York, NY, USA},
 pages        = {7--14},
 doi          = {10.1145/800235.807068},
)
@inproceedings(Bur77,
 author       = {R.~M. Burstall},
 year         = {1977},
 title        = {Design {C}onsiderations for a {F}unctional {P}rogramming {L}anguage},
 booktitle    = {Proc. Infotech State of the Art Conference ``The Software Revolution'', Copenhagen, Denmark},
 pages        = {47--57},
)
@article(BuD77,
 author       = {R.~M. Burstall and J.~Darlington},
 year         = {1977},
 title        = {A Transformation System for Developing Recursive Programs},
 journal      = {Journal of the {ACM}},
 volume       = {24},
 number       = {1},
 pages        = {44--67},
 doi          = {10.1145/321992.321996},
)
@inproceedings(Bu&80,
 author       = {R.~M. Burstall and D.B. MacQueen and G.~H. Sannella},
 year         = {1980},
 title        = {Hope: {A}n Experimental Applicative Language},
 booktitle    = {Conference Record of the 1980 LISP Conference, Stanford University, Stanford, Ca, USA},
 pages        = {136--143},
 doi          = {10.1145/800087.802799},
)
@incollection(Cla78,
 author       = {K.~L. Clark},
 year         = {1978},
 title        = {Negation as Failure},
 editor       = {H.~Gallaire and J.~Minker},
 booktitle    = {Logic and Data Bases},
 publisher    = {Plenum Press},
 address      = {New York},
 pages        = {293--322},
 doi          = {10.1007/978-1-4684-3384-5_11},
)
@book(ClM84,
 author       = {W.~F. Clocksin and C.~S. Mellish},
 year         = {1984},
 title        = {Programming in {Prolog}},
 edition      = {{Second}},
 publisher    = {Springer-Verlag},
 address      = {New York},
 doi          = {10.1007/978-3-642-96873-0},
)
@book(CuF74,
 author       = {H.~B. Curry and R.~Feys},
 year         = {1974},
 title        = {Combinatory Logic},
 publisher    = {North-Holland},
)
@article(Dar78,
 author       = {J.~Darlington},
 year         = {1978},
 title        = {A Synthesis of Several Sorting Algorithms},
 journal      = {Acta Informatica},
 volume       = {11},
 pages        = {1--30},
 doi          = {10.1007/BF00264597},
)
@article(Dar81,
 author       = {J.~Darlington},
 year         = {1981},
 title        = {An Experimental Program Transformation System},
 journal      = {Artificial Intelligence},
 volume       = {16},
 pages        = {1--46},
 doi          = {10.1016/0004-3702(81)90014-X},
)
@inproceedings(De&16b,
 author       = {E.~{De Angelis} and F.~Fioravanti and M.~C. Meo and A.~Pettorossi and M.~Proietti},
 year         = {2017},
 title        = {Verification of Time-Aware Business Processes using Constrained {H}orn Clauses},
 booktitle    = {Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation $($LOPSTR 2016\/$)$},
 series       = {Lecture Notes in Computer Science 10184},
 publisher    = {Springer},
 pages        = {38--55},
 doi          = {10.1007/978-3-319-63139-4_3},
)
@inproceedings(De&14b,
 author       = {E.~{De~Angelis} and F.~Fioravanti and A.~Pettorossi and M.~Proietti},
 year         = {2014},
 title        = {{V}eri{MAP}\tmspace+\thinmuskip{.1667em}$:$ {A} {T}ool for {V}erifying {P}rograms through {T}ransformations},
 booktitle    = {Proc. 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS~'14},
 series       = {Lecture Notes in Computer Science 8413},
 publisher    = {Springer},
 pages        = {568--574},
 doi          = {10.1007/978-3-642-54862-8\_47},
 note         = {Available at: {\rm http://www.map.uniroma2.it/VeriMAP}},
)
@article(De&17b,
 author       = {E.~{De Angelis} and F.~Fioravanti and A.~Pettorossi and M.~Proietti},
 year         = {2017},
 title        = {Semantics-based generation of verification conditions via program specialization},
 journal      = {Science of Computer Programming},
 volume       = {147},
 pages        = {78--108},
 doi          = {10.1016/j.scico.2016.11.002},
 note         = {Selected and Extended papers from the Int. Symp. on Principles and Practice of Declarative Programming 2015},
)
@article(Der87,
 author       = {N.~Dershowitz},
 year         = {1987},
 title        = {Termination of rewriting},
 journal      = {Journal of Symbolic Computation},
 volume       = {3},
 number       = {1-2},
 pages        = {69--116},
 doi          = {10.1016/S0747-7171(87)80022-6},
)
@techreport(Dij71,
 author       = {E.~W. Dijkstra},
 year         = {1971},
 title        = {A {S}hort {I}ntroduction to the {A}rt of {P}rogramming},
 type         = {Technical {R}eport},
 institution  = {EWD 316},
)
@book(Dij82,
 author       = {E.~W. Dijkstra},
 year         = {1982},
 title        = {Selected Writing on Computing: {A} Personal Perspective},
 publisher    = {Springer-Verlag},
 address      = {New York, Heidelberg, Berlin},
 doi          = {10.1007/978-1-4612-5695-3},
)
@article(Er83,
 author       = {M.~C. Er},
 year         = {1983},
 title        = {An iterative solution to the generalized {T}owers of {H}anoi problems},
 journal      = {BIT},
 volume       = {23},
 pages        = {295--302},
 doi          = {10.1007/BF01934458},
)
@inproceedings(FlS74,
 author       = {P.~Flajolet and J.-M. Steyaert},
 year         = {1974},
 title        = {On Sets Having Only Hard Subsets},
 editor       = {J.~Loeckx},
 booktitle    = {2nd ICALP, Automata, Languages and Programming},
 series       = {Lecture Notes in Computer Science 14},
 publisher    = {Springer},
 pages        = {446--457},
 doi          = {10.1007/978-3-662-21545-6_34},
)
@article(GeC92,
 author       = {D.~Gelernter and N.~Carriero},
 year         = {1992},
 title        = {Coordination Languages and their Significance},
 journal      = {Communications of the ACM},
 volume       = {35},
 number       = {2},
 pages        = {97--107},
 doi          = {10.1145/129630.129635},
)
@article(Hay77,
 author       = {P.~J. Hayes},
 year         = {1977},
 title        = {A note on the {T}owers of {H}anoi problem},
 journal      = {The Computer Journal},
 volume       = {20},
 number       = {3},
 pages        = {282--285},
 doi          = {10.1093/comjnl/20.3.282},
)
@book(Hi&75,
 author       = {J.~R. Hindley and B.~Lercher and J.~P. Seldin},
 year         = {1975},
 title        = {Introduzione alla {L}ogica {C}ombinatoria},
 series       = {Serie di {L}ogica {M}atematica},
 publisher    = {Boringhieri},
 note         = {(In Italian)},
)
@book(HiS86,
 author       = {J.~R. Hindley and J.~P. Seldin},
 year         = {1986},
 title        = {Introduction to {C}ombinators and $\lambda$-{C}alculus},
 series       = {London Mathematical Society},
 publisher    = {Cambridge University Press},
 doi          = {10.1007/BF00047236},
)
@article(Hoa78,
 author       = {C.A.R. Hoare},
 year         = {1978},
 title        = {Communicating {S}equential {P}rocesses},
 journal      = {CACM},
 volume       = {21},
 number       = {8},
 pages        = {666--677},
 doi          = {10.1145/359576.359585},
)
@book(HoU79,
 author       = {J.~E. Hopcroft and J.~D. Ullman},
 year         = {1979},
 title        = {Introduction to Automata Theory, Languages and Computation},
 publisher    = {Addison-Wesley},
 doi          = {10.1145/568438.568455},
)
@article(Hug86,
 author       = {R.~J.~M. Hughes},
 year         = {1986},
 title        = {A novel representation of lists and its application to the function {``reverse''}},
 journal      = {Info. Proc. Lett.},
 volume       = {22},
 pages        = {141--144},
 doi          = {10.1016/0020-0190(86)90059-1},
)
@article(ItZ71,
 author       = {V.~E. Itkin and Z.~Zwienogrodsky},
 year         = {1971},
 title        = {On equivalence of program schemata},
 journal      = {Journ. Comp. Syst. Sci.},
 volume       = {5},
)
@inproceedings(Ka&90,
 author       = {S.~Kasangian and A.~Labella and A.~Pettorossi},
 year         = {1990},
 title        = {Observers, experiments, and agents: {A} comprehensive approach to parallelism},
 editor       = {I.~Guessarian},
 booktitle    = {Semantics of Systems of Concurrent Processes. LITP Spring School},
 series       = {Lecture Notes in Computer Science 469},
 publisher    = {Springer-Verlag},
 pages        = {375--406},
 doi          = {10.1007/3-540-53479-2_16},
)
@book(Kel82,
 author       = {G.~M. Kelly},
 year         = {1982},
 title        = {Basic Concepts of Enriched Category Theory},
 publisher    = {Cambridge University Press, Cambridge},
)
@book(Kow79b,
 author       = {R.~A. Kowalski},
 year         = {1979},
 title        = {Logic for Problem Solving},
 publisher    = {North Holland},
 note         = {Available at: www.doc.ic.ac.uk/\newline\textasciitilde rak/papers/LogicForProblemSolving.pdf},
)
@article(LaP85,
 author       = {A.~Labella and A.~Pettorossi},
 year         = {1985},
 title        = {Categorical {M}odels for {H}andshaking {C}ommunications},
 journal      = {Fundamenta {I}nformaticae. Series IV.},
 volume       = {VIII},
 number       = {3-4},
 pages        = {322--357},
)
@article(Lav61,
 author       = {S.~S. Lavrov},
 year         = {1961},
 title        = {Economy of memory in closed operator schemes},
 journal      = {U.S.S.R. Computat. Math. and Math. Physics},
 pages        = {810--828},
)
@book(Llo87,
 author       = {J.~W. Lloyd},
 year         = {1987},
 title        = {Foundations of Logic Programming},
 publisher    = {Springer-Verlag},
 address      = {Berlin},
 doi          = {10.1007/978-3-642-83189-8},
 note         = {Second Edition},
)
@article(Mar65,
 author       = {V.~V. Martynuk},
 year         = {1965},
 title        = {On the analysis of control-flow graphs for a program scheme},
 journal      = {Journ. Comp. Math. and Math. Phys.},
 volume       = {5,2},
)
@book(Men87,
 author       = {E.~Mendelson},
 year         = {1987},
 title        = {Introduction to {M}athematical {L}ogic},
 publisher    = {Wadsworth \& Brooks/Cole Advanced Books \& Software},
 address      = {Monterey, California, {USA}},
 doi          = {10.2307/2274877},
 note         = {Third Edition},
)
@article(MiB66,
 author       = {J.~Miller and S.~Brown},
 year         = {1966},
 title        = {An algorithm for evaluation of remote terms in a linear recurrence sequence},
 journal      = {The {C}omputer {J}ournal},
 volume       = {9},
 pages        = {188--190},
 doi          = {10.1093/comjnl/9.2.188},
)
@book(Mil89,
 author       = {R.~Milner},
 year         = {1989},
 title        = {Communication and Concurrency},
 publisher    = {Prentice Hall},
 doi          = {10.5555/534666},
)
@book(New01,
 author       = {J.~H. Newman},
 year         = {2001},
 title        = {Apologia {P}ro {V}ita {S}ua},
 publisher    = {Maisie Ward (ed.), Sheed and Ward, London},
)
@inproceedings(PaH70,
 author       = {M.~S. Paterson and C.~E. Hewitt},
 year         = {1970},
 title        = {Comparative Schematology},
 booktitle    = {Conference on Concurrent Systems and Parallel Computation Project {MAC}, Woods Hole, Mass., {USA}},
 pages        = {119--127},
 note         = {Available at: https://dl.acm.org/doi/pdf/10.1145/1344551.1344563},
)
@unpublished(Pet71,
 author       = {A.~Pettorossi},
 year         = {1971},
 title        = {Ottimizzazione di un Collegamento per Trasmissione di Dati Mediante Simulazione Numerica},
 note         = {Laurea Thesis (in Italian). University of Rome, Italy. Available on request to the author.},
)
@unpublished(Pet72,
 author       = {A.~Pettorossi},
 year         = {1972},
 title        = {Automatic Derivation of Control Flow Graphs of Fortran Programs},
 note         = {Master Thesis (in Italian). Original title: \textquotedblleft Generazione Automatica del Grafo di Flusso del Controllo per un Programma di Calcolo Scritto in Fortran\textquotedblright. University of Rome, Italy. Available on request to the author.},
)
@inproceedings(Pet78,
 author       = {A.~Pettorossi},
 year         = {1978},
 title        = {Improving memory utilization in transforming programs},
 booktitle    = {Proc. Mathematical Foundations of Computer Science 1978, Zakopane $(\tmspace-\thinmuskip{.1667em}$Poland\/$)$},
 series       = {Lecture Notes in Computer Science 64},
 publisher    = {Springer-Verlag},
 pages        = {416--425},
 doi          = {10.1007/3-540-08921-7_89},
)
@inproceedings(Pet79,
 author       = {A.~Pettorossi},
 year         = {1979},
 title        = {On the Definition of Hierarchies of Infinite Sequential Computations},
 editor       = {Lothar Budach},
 booktitle    = {Fundamentals of Computation Theory, FCT'79},
 publisher    = {Akademic-Verlag},
 address      = {Berlin},
 pages        = {335--341},
 note         = {Available on request to the author.},
)
@inproceedings(Pet80a,
 author       = {A.~Pettorossi},
 year         = {1980},
 title        = {Synthesis of Subtree Rewriting Systems Behaviour by Solving Equations},
 booktitle    = {Proc. 5\`eme {C}olloque de {L}ille $($\tmspace-\thinmuskip{.1667em}{F}rance$)$ on ``{L}es {A}rbres en {A}lg\`{e}bre et en {P}rogrammation''},
 publisher    = {U.E.R. I.E.E.A. BP 36, Universit\'e de {L}ille I, 59655 {V}illeneuve d'Ascq Cedex, France},
 pages        = {63--74},
 note         = {Available on request to the author.},
)
@inproceedings(Pet81a,
 author       = {A.~Pettorossi},
 year         = {1981},
 title        = {Comparing and Putting Together {R}ecursive {P}ath {O}rderings, {S}implification {O}rderings, and {N}on-{A}scending Property for Termination Proofs of {T}erm {R}ewriting {S}ystems},
 booktitle    = {Proc. ICALP 1981, Haifa $(\tmspace-\thinmuskip{.1667em}$Israel\/$)$},
 series       = {Lecture Notes in Computer Science 115},
 publisher    = {Springer-Verlag},
 pages        = {432--447},
 doi          = {10.1007/3-540-10843-2\_35},
)
@phdthesis(Pet84c,
 author       = {A.~Pettorossi},
 year         = {1984},
 title        = {Methodologies for Transformations and Memoing in Applicative Languages},
 school       = {Edinburgh University},
 address      = {Edinburgh, Scotland},
 note         = {Available at: \newline https://era.ed.ac.uk/handle/1842/15643},
)
@inproceedings(Pet84a,
 author       = {A.~Pettorossi},
 year         = {1984},
 title        = {A Powerful Strategy for Deriving Efficient Programs by Transformation},
 booktitle    = {{ACM} Symposium on Lisp and Functional Programming},
 publisher    = {ACM Press},
 pages        = {273--281},
 doi          = {10.1145/800055.802044},
)
@article(Pet85a,
 author       = {A.~Pettorossi},
 year         = {1985},
 title        = {Towers of {H}anoi Problems: Deriving Iterative Solutions by Program Transformation},
 journal      = {BIT},
 volume       = {25},
 pages        = {327--334},
 doi          = {10.1007/BF01934378},
)
@article(Pet87a,
 author       = {A.~Pettorossi},
 year         = {1987},
 title        = {Derivation of Efficient Programs For Computing Sequences of Actions},
 journal      = {Theoretical Computer Science},
 volume       = {53},
 pages        = {151--167},
 doi          = {10.1016/0304-3975(87)90030-2},
)
@article(PeB82,
 author       = {A.~Pettorossi and R.~M. Burstall},
 year         = {1982},
 title        = {Deriving Very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique},
 journal      = {Acta Informatica},
 volume       = {18},
 pages        = {181--206},
 doi          = {10.1007/BF00264438},
)
@inproceedings(PeP99b,
 author       = {A.~Pettorossi and M.~Proietti},
 year         = {2000},
 title        = {Transformation Rules for Logic Programs with Goals as Arguments},
 editor       = {A.~Bossi},
 booktitle    = {Proceedings of the 9th International Workshop on Logic-based Program Synthesis and Transformation $($LOPSTR '99\/$)$, Venezia, Italy},
 series       = {Lecture Notes in Computer Science 1817},
 publisher    = {Springer-Verlag},
 address      = {Berlin},
 pages        = {177--196},
 doi          = {10.1007/10720327\_11},
)
@article(PeP02b,
 author       = {A.~Pettorossi and M.~Proietti},
 year         = {2002},
 title        = {The List Introduction Strategy for the Derivation of Logic Programs},
 journal      = {Formal Aspects of Computing},
 volume       = {13},
 number       = {3-5},
 pages        = {233--251},
 doi          = {10.1007/s001650200011},
)
@incollection(PeP02a,
 author       = {A.~Pettorossi and M.~Proietti},
 year         = {2002},
 title        = {Program {D}erivation = {R}ules $+$ {S}trategies},
 editor       = {A.~Kakas and F.~Sadri},
 booktitle    = {Computational Logic: {L}ogic Programming and Beyond {\rm (}Essays in honour of Bob Kowalski, Part I{\rm )}},
 series       = {Lecture Notes in Computer Science 2407},
 publisher    = {Springer-Verlag},
 pages        = {273--309},
 doi          = {10.1007/3-540-45628-7\_12},
)
@techreport(PeS83,
 author       = {A.~Pettorossi and A.~Skowron},
 year         = {1983},
 title        = {Complete {M}odal {T}heories for {V}erifying {C}ommunicating {A}gents {B}ehaviour in {R}ecursive {E}quations {P}rograms},
 type         = {Internal {R}eport},
 number       = {CSR-128-83},
 institution  = {University of Edinburgh},
 address      = {Edinburgh, Scotland},
 note         = {Available on request to the authors.},
)
@inproceedings(PeS85a,
 author       = {A.~Pettorossi and A.~Skowron},
 year         = {1985},
 title        = {A methodology for improving parallel programs by adding communications},
 booktitle    = {Computation Theory, SCT 1984},
 series       = {Lecture Notes in Computer Science 280},
 publisher    = {Springer-Verlag},
 address      = {Berlin},
 pages        = {228--250},
 doi          = {10.1007/3-540-16066-3\_20},
)
@inproceedings(PeS85b,
 author       = {A.~Pettorossi and A.~Skowron},
 year         = {1985},
 title        = {A System for Developing Distributed Communicating Programs},
 editor       = {M.~Feilmeier and G.~Joubert and U.~Schendel},
 booktitle    = {International Conference `Parallel Computing 85'},
 publisher    = {North-Holland},
 pages        = {241--246},
 note         = {Available on request to the authors.},
)
@article(PeS89,
 author       = {A.~Pettorossi and A.~Skowron},
 year         = {1989},
 title        = {The Lambda Abstraction Strategy for Program Derivation},
 journal      = {Fundamenta Informaticae},
 volume       = {XII},
 number       = {4},
 pages        = {541--561},
 note         = {Available on request to the authors.},
)
@article(PeP04,
 author       = {Alberto Pettorossi and Maurizio Proietti},
 year         = {2004},
 title        = {Transformations of Logic Programs with Goals as Arguments},
 journal      = {Theory Pract. Log. Program.},
 volume       = {4},
 number       = {4},
 pages        = {495--537},
 doi          = {10.1017/S147106840400198X},
)
@inproceedings(PrP90b,
 author       = {M.~Proietti and A.~Pettorossi},
 year         = {1990},
 title        = {Synthesis of Eureka Predicates for Developing Logic Programs},
 editor       = {N.~D. Jones},
 booktitle    = {Third European Symposium on Programming, ESOP '90},
 series       = {Lecture Notes in Computer Science 432},
 publisher    = {Springer-Verlag},
 pages        = {306--325},
 doi          = {10.1007/3-540-52592-0\_71},
)
@inproceedings(PrP91b,
 author       = {M.~Proietti and A.~Pettorossi},
 year         = {1991},
 title        = {Unfolding-Definition-Folding, in this Order, for Avoiding Unnecessary Variables in Logic Programs},
 editor       = {J.~Ma{\l}uszy\'{n}ski and M.~Wirsing},
 booktitle    = {Third International Symposium on Programming Language Implementation and Logic Programming, PLILP '91},
 series       = {Lecture Notes in Computer Science 528},
 publisher    = {Springer-Verlag},
 pages        = {347--358},
 doi          = {10.1007/3-540-54444-5\_111},
)
@book(Rog67,
 author       = {H.~Rogers},
 year         = {1967},
 title        = {Theory of Recursive Functions and Effective Computability},
 publisher    = {McGraw-Hill},
)
@book(StS94,
 author       = {L.~S. Sterling and E.~Shapiro},
 year         = {1994},
 title        = {The Art of {P}rolog},
 publisher    = {The MIT Press},
 address      = {Cambridge, Massachusetts},
 note         = {Second Edition},
)
@inproceedings(TaS84,
 author       = {H.~Tamaki and T.~Sato},
 year         = {1984},
 title        = {Unfold/Fold Transformation of Logic Programs},
 editor       = {S.-{\r A}. T{{\"a}}rnlund},
 booktitle    = {Proceedings of the Second International Conference on Logic Programming,~ICLP~'84},
 publisher    = {Uppsala University},
 address      = {Uppsala, Sweden},
 pages        = {127--138},
)
@article(WaS73,
 author       = {S.~A. Walker and H.~R. Strong},
 year         = {1973},
 title        = {Characterization of Flowchartable Recursions},
 journal      = {Journal of Computer and System Sciences},
 volume       = {7},
 number       = {4},
 pages        = {404--447},
 doi          = {10.1016/S0022-0000(73)80032-7},
)
@techreport(War77,
 author       = {D.~H.~D. Warren},
 year         = {1977},
 title        = {Implementing {P}rolog -- Compiling Predicate Logic Programs},
 type         = {Research Report},
 number       = {39 \& 40},
 institution  = {Department of Artificial Intelligence, University of Edinburgh, Scotland},
)
@techreport(War83,
 author       = {D.~H.~D. Warren},
 year         = {1983},
 title        = {An Abstract {P}rolog Instruction Set},
 type         = {Technical Report},
 number       = {309},
 institution  = {SRI International},
)
@article(Wa&77,
 author       = {D.~H.~D. Warren and L.~M. Pereira and F.~Pereira},
 year         = {1977},
 title        = {Prolog - {t}he language and its implementation compared with {L}isp},
 journal      = {{SIGART} Newsl.},
 volume       = {64},
 pages        = {109--115},
 doi          = {10.1145/872736.806939},
)
@article(Win84,
 author       = {G.~Winskel},
 year         = {1984},
 title        = {Synchronization Trees},
 journal      = {Theoretical Computer Science},
 volume       = {34},
 number       = {1-2},
 pages        = {33--82},
 doi          = {10.1016/0304-3975(84)90112-9},
)
@article(Yan60,
 author       = {Y.~I. Yanov},
 year         = {1960},
 title        = {The {L}ogical {S}chemes of Algorithms},
 journal      = {Problems of {C}ybernetics},
 volume       = {1},
 pages        = {82--140},
 note         = {English translation},
)