No CrossRef data available.
Article contents
A liberal type system for functional logic programs†
Published online by Cambridge University Press: 10 November 2014
Abstract
We propose a new type system for functional logic programming which is more liberal than the classical Damas–Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas–Milner typing of expressions, we propose a new notion of well-typed program that adds support for type-indexed functions, a particular form of existential types, opaque higher-order patterns and generic functions – as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as ‘free theorems’ were already compromised in functional logic programming because of non-determinism.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 25 , Issue 4: APLAS 2010 , May 2015 , pp. 942 - 977
- Copyright
- Copyright © Cambridge University Press 2014
Footnotes
This work has been partially supported by the Spanish projects STAMP (TIN2008-06622-C03-01), Prometidos-CM (S2009TIC-1465) and GPD (UCM-BSCH-GR35/10-A-910502).
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:28080:20160415013545031-0971:S0960129513000091_inline1.gif?pub-status=live)