[Haskell-cafe] Pure functional and pure logical language at the same time

[Mathieu Boespflug]

By "pure logical", do you mean "logically consistent"? Or do you mean
a logic language in the style of Prolog but with no non-logical
effects such as programmatic pruning of the search tree?

If the former, there are many languages in that fit the bill (or at
least are believed to be consistent): Coq, Agda, HOL, ... The key
difference between those languages and Haskell is that all functions
must be provably total. See

https://uf-ias-2012.wikispaces.com/file/view/turner.pdf

from the father of a direct ancestor of Haskell, arguing for precisely
this: a total functional programming language (not that I agree that
such a language as proposed in the paper would be particularly
useful).

If you mean the former, there are language that try to combine logical
and functional programming, see e.g. Curry just mentioned in this
thread a few minutes ago.


On 28 January 2015 at 18:22, Timotej Tomandl <timotej.tomandl at gmail.com> wrote:
> This question was bugging me for quite a long time. Can we have a language
> which uses the functional logic while being both pure functional and pure
> logical?
> Do we get any advantages from maintaining both both of this purities at the
> same time?
>
> P.S.: I have feeling the answer is no, but I am not sure.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>