[HN05]

Ángel Herranz and Pablo Nogueira. More than parsing. In Francisco Javier López Fraguas, editor, Actas de las V Jornadas sobre Programación y Lenguajes - PROLE'05, I Congreso Español de Informática - CEDI'05, pages 193--202. Thomson Paraninfo, September 13-16 2005. [ bib | .pdf ]

We introduce Generalised Object Normal Form (GONF), a syntax formalism that enables language designers to define concrete syntax in a form that also naturally defines the data structure of the abstract syntax tree. More precisely, GONF's grammatical productions specify simultaneously and without annotations (1) concrete syntax (a language and its parser) and (2) the collection of 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 MTP, an available GONF-based tool.

[Pér05]

Iván Pérez. Automatización de la obtención de claves públicas de confianza. In In Proceedings of the first Spanish Conference on Informatics (CEDI 2005), Information Security Symposium, Granada, September 2005. CEDI'05, Thomson Paraninfo. [ bib | .pdf ]

[MR05]

Julio Mariño and José María Rey. Adding constraints to curry via flat guards. In Michael Hanus, editor, First Workshop on Curry and Functional Logic Programming. ACM Press, September 2005. [ bib ]

[GM05a]

Emilio Jesús Gallego and Julio Mariño. An overview of the sloth2005 curry system. In Michael Hanus, editor, First Workshop on Curry and Functional Logic Programming. ACM Press, September 2005. [ bib ]

[DN05]

Louise A. Dennis and Pablo Nogueira. What can be learned from failed proofs of non-theorems? In J. Hurd, E. Smith, and A. Darbari, editors, Emerging Trends Proceedings of the 18th International Conference on Theorem Proving in Higher-Order Logics TPHOLs'05, Oxford University Computer Laboratory Research Report RR-05-02, pages 45--58, Oxford, UK, August 22-25 2005. [ bib | .pdf ]

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

[Nog05]

Pablo Nogueira. The gist of side effects in pure functional languages, June 28 2005. Tutorial. [ bib | .pdf ]

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

[GM05b]

Emilio Jesús Gallego Arias and Julio Mariño. An overview of the Sloth2005 Curry system: system description. In WCFLP '05: Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming, pages 66--69, New York, NY, USA, 2005. ACM Press. [ bib | DOI ]

This file was generated by bibtex2html 1.98.