I found Curry on Wikipedia. It says Curry is nearly a superset but not because of lacking of something. I'd like to see it support whole Haskell. Did they plan to implement Haskell as a part...

I have a standard datatype representing formulae of predicate logic. A function representing a natural deduction elimination rule for disjunction might look like: d_el p q = if p =: (Dis r s) &am...

What's the most practical way to write a program in Curry programming language that would have a console UI with decent line editing? Actually, I need to pass a string as a suggestion for the user...

From section 3.13.3 of the curry tutorial: Operations that residuate are called rigid , whereas operations that narrow are called flexible. All defined operations are flexible whereas most primi...

Consider a function choose in Curry programming language with the specification that "(choose xs) non-deterministically chooses one element from the list xs". I'd implement it straighforwardly thr...

I've come across the following code snippet (a function definition): choose (x:xs) = choosep x xs where choosep x [] = x choosep x (_:_) = x choosep _ (x:xs) = choosep x xs in Curry programm...

I would like to ask you about what formal system could be more interesting to implement from scratch/reverse engineer. I've looked through some existing and open-source projects of logical/declar...