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

@comment{{2015}}

@inproceedings{sloth2005,
  author = {Emilio Jes{\'u}s {Gallego Arias} and Julio Mari{\~n}o},
  title = {An overview of the {S}loth2005 {C}urry system: system
                  description},
  booktitle = {WCFLP '05: Proceedings of the 2005 ACM SIGPLAN workshop on
                  Curry and functional logic programming},
  year = 2005,
  isbn = {1-59593-069-8},
  pages = {66--69},
  location = {Tallinn, Estonia},
  doi = {http://doi.acm.org/10.1145/1085099.1085113},
  publisher = {ACM Press},
  address = {New York, NY, USA}
}

@inproceedings{pni:tphols05:nonth,
  tipoactividad = {Ponencias en congresos},
  internacional = {yes},
  revisores = {yes},
  author = {Louise A. Dennis and Pablo Nogueira},
  title = {What can be learned from failed proofs of non-theorems?},
  booktitle = {Emerging {T}rends {P}roceedings of the 18th {I}nternational
                  {C}onference on {T}heorem {P}roving in {H}igher-{O}rder
                  {L}ogics {TPHOL}s'05},
  year = 2005,
  pages = {45-58},
  series = {Oxford University Computer Laboratory Research Report
                  RR-05-02},
  editor = {J. Hurd and E. Smith and A. Darbari},
  address = {Oxford, UK},
  month = {August 22-25},
  abstract = {This paper reports an investigation into the link between
                  failed proofs and non-theorems. It seeks to answer the
                  question of whether anything more can be learned from a
                  failed proof attempt than can be discovered from a
                  counter-example. We suggest that the branch of the proof in
                  which failure occurs can be mapped back to the segments of
                  code that are the culprit, helping to locate the error. This
                  process of tracing provides finer grained isolation of the
                  offending code fragments than is possible from the
                  inspection of counter-examples. We also discuss ideas for
                  how such a process could be automate},
  url = {http://babel.ls.fi.upm.es/~pablo/Papers/non-theorems.pdf}
}

@misc{pni:gist05,
  tipoactividad = {Otras publicaciones},
  internacional = {yes},
  author = {Pablo Nogueira},
  title = {The Gist of Side Effects in Pure Functional Languages},
  month = {June 28},
  year = 2005,
  note = {Tutorial},
  abstract = {We explain the gist of how to attain side effects in pure
                  functional programming languages via monads and unique types
                  with input-output as a motivating example. Our vehicle for
                  illustration is the strongly type-checked, pure, and
                  non-strict functional language Haskell. The
                  category-theoretical origins of monads are explained.  Some
                  basic notions of Category Theory are also presented in
                  programming terms. We provide a list of suggested reading
                  material in the references},
  pdf = {http://babel.ls.fi.upm.es/~pablo/Papers/Notes/gist-effects.pdf}
}

@inproceedings{heno:2005:mtp,
  author = {{{\'{A}}ngel} Herranz and Pablo Nogueira},
  title = {More Than Parsing},
  booktitle = {Actas de las {V} {J}ornadas sobre {P}rogramaci{\'{o}}n y
                  {L}enguajes - {PROLE}'05, I {C}ongreso {E}spa{\~{n}}ol de
                  {I}nform{\'{a}}tica - {CEDI}'05},
  pages = {193-202},
  year = 2005,
  editor = {Francisco Javier {L{\'{o}}pez Fraguas}},
  month = {September 13-16},
  publisher = {Thomson Paraninfo},
  isbn = {84-9732-438-2},
  abstract = {We introduce \emph{Generalised Object Normal Form} (GONF), a
                  syntax formalism that enables language designers to define
                  concrete syntax in a form that \emph{also naturally} defines
                  the data structure of the abstract syntax tree. More
                  precisely, GONF's grammatical productions specify
                  \emph{simultaneously} and without annotations (1) concrete
                  syntax (a language and its parser) and (2) the collection of
                  \emph{language-independent} data type definitions
                  representing the abstract syntax tree accurately and
                  concisely.  These types can be materialised in languages
                  supporting inheritance or algebraic types, and preferably
                  parametric polymorphism. We also describe \emph{MTP}, an
                  available GONF-based tool.},
  url = {http://babel.ls.fi.upm.es/~angel/papers/finalcopy-2005prole.pdf}
}

@inproceedings{ip:2005:cediis,
  author = {P{\'{e}}rez, Iv{\'{a}}n},
  title = {Automatizaci{\'{o}}n de la obtenci{\'{o}}n de claves p{\'{u}}blicas de confianza},
  booktitle = {In Proceedings of the first Spanish Conference on Informatics (CEDI 2005), Information Security Symposium},
  publisher = {Thomson Paraninfo},
  address = {Granada},
  organization = {CEDI'05},
  month = sep,
  year = 2005,
  isbn = {84-9732-447-1},
  url = {http://babel.ls.fi.upm.es/~iperez/papers/finalcopy-2005cedisi.pdf},
  internacional = {no},
  tipoactividad = {Ponencias en congresos},
  revisores = {yes}
}

@inproceedings{marinno:rey:2005:wcflp,
  author = {Julio Mari{\~{n}}o and Jos{\'{e}} Mar{\'{i}}a Rey},
  title = {Adding Constraints to Curry via Flat Guards},
  booktitle = {First Workshop on Curry and Functional Logic Programming},
  year = 2005,
  editor = {Michael Hanus},
  month = sep,
  publisher = {ACM Press}
}

@inproceedings{gallego:marinno:2005:wcflp,
  author = {Emilio Jes{\'{u}}s Gallego and Julio Mari{\~{n}}o},
  title = {An Overview of the Sloth2005 Curry System},
  booktitle = {First Workshop on Curry and Functional Logic Programming},
  year = 2005,
  editor = {Michael Hanus},
  month = sep,
  publisher = {ACM Press}
}

This file was generated by bibtex2html 1.98.