Difference between revisions of "Open research problems"
BrettGiles (talk | contribs) m (OpenProblem moved to Open research problems) |
m (tweaked formatting) |
||
| (8 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| + | [[Category:Research]] |
||
| ⚫ | This is a problem that came up during IRC discussions. We consider a purely functional language. By purely functional we mean a language that has value semantics |
||
| + | ==Efficiency of lazy functional languages== |
||
| ⚫ | |||
| ⚫ | This is a problem that came up during IRC discussions. We consider a purely functional language L. By "purely functional" we mean a language that has value semantics; that is, there is no function such that after evaluation of the function the value that was referred to by something else changed. (Also known as "No Side Effects"). A value is "changed" when it is not the case during an evaluation that when the old value and the new value would both be fully evaluated, there wouldn't be the same result. This should make sure that laziness is allowed in the purely functional language. |
||
| ⚫ | |||
| ⚫ | |||
| − | Given a list of numbers, implement a data type s.t. every number is stored in a structure, all structures together holds the numbers exactly once. One operation that needs to be supported is to move one element(it doesn't matter which one) to another structure (possibly creating a new structure). A second operation is that given a number one should be able to return the structure holding that number. All operations should run in amortized O(1) time. |
||
| + | ===Specific problems=== |
||
| − | [1] It might be the case that this is a trivial problem and that I forgot some further conditions, if that's the case I will correct it later when a solution is posted. |
||
| ⚫ | |||
| + | Implement <code>Data.STRef</code> and <code>Control.Monad.ST.runST</code> without using the built-in <code>ST</code>/<code>IO</code> monad. This needs to happen with operations that all run in O(1) amortized time. |
||
Revision as of 06:27, 21 May 2007
Efficiency of lazy functional languages
This is a problem that came up during IRC discussions. We consider a purely functional language L. By "purely functional" we mean a language that has value semantics; that is, there is no function such that after evaluation of the function the value that was referred to by something else changed. (Also known as "No Side Effects"). A value is "changed" when it is not the case during an evaluation that when the old value and the new value would both be fully evaluated, there wouldn't be the same result. This should make sure that laziness is allowed in the purely functional language.
The general problem is whether these purely functional languages can implement all algorithms that can be implemented in a language like C as efficiently in an amortized sense ignoring space-usage.
Specific problems
As for a specific problem:
Implement Data.STRef and Control.Monad.ST.runST without using the built-in ST/IO monad. This needs to happen with operations that all run in O(1) amortized time.