@comment{{Al final apareció en 2018}}

@comment{{2015}}

@inproceedings{kulomoro:1990:gbifll,
  author = {Herbert Kuchen and Rita Loogen and Juan Jos{\'{e}} {Moreno-Navarro}
                  and Mario {Rodr{\'{i}}guez-Artalejo}},
  title = {Graph-based Implementation of a Functional Logic Language},
  booktitle = {Proceedings of the 3rd Symposium on Programming},
  volume = {432},
  publisher = {Springer-Verlag},
  address = {Berlin},
  editor = {N. Jones},
  year = {1990},
  url = {http://citeseer.nj.nec.com/article/kuchen90graphbased.html},
  postscript = {/papers/ibam.ps.gz},
  keywords = {implementation of funtional logic languages, narrowing},
  abstract = {We investigate the development of a graph reduction machine
                  for a higher-order functional logic language by extension of
                  an appropiate architecture for purely functional
                  languages. To execute logic programs the machine must be
                  capable of perfoming unification and backtracking. We show
                  the integration of these mechanisms in a programmed
                  (functional) graph reduction machine. The new machine has
                  been implemented on a transputer system.}
}

@inproceedings{mokuloro:1990:lngm,
  author = {Juan Jos{\'{e}} {Moreno-Navarro} and Herbert Kuchen and Rita
                  Loogen and Mario {Rodr{\'{i}}guez-Artalejo}},
  title = {Lazy Narrowing in a Graph Machine},
  booktitle = {2nd International Conference on Algebraic and Logic
                  Programming, Nancy (France)},
  organization = { CRIN (Centre de Recherche en Informatique de Nancy)},
  month = oct,
  year = {1990},
  editor = {H. Kichner and W. Wechler},
  publisher = {LNCS, Springer Verlag},
  pages = { 298-317},
  postscript = {/papers/lbam.ps.gz},
  keywords = {implementation of functional logic languages, lazy
                  narrowing},
  abstract = {The paper investigates the implementation of lazy narrowing
                  in the framework of a graph reduction machine. By extending
                  an appropriate architecture for purely functional languages
                  an abstract graph narrowing machine for a functional logic
                  language is constructed. The machine is capable of
                  performing unification and backtracking. The techniques used
                  in functional languages to cope with lazy evaluation are not
                  directly applicable, but must be modified due to the logic
                  component of the implemented language. A prototype
                  implementation of the new machine has been developed.}
}

This file was generated by bibtex2html 1.98.