Free Online Rust to Haskell Code Converter

Instantly convert code snippets from Rust to Haskell with our free online code converter. Transform your code easily and accurately.

How to Use Our Rust to Haskell Code Converter

Paste your Rust code snippet into the input box.
Click the "Convert" button to transform your code.
Our AI-powered converter will instantly translate your Rust code to Haskell.
Copy the converted Haskell code and use it in your project.

Is Our Rust to Haskell Converter Secure?

We prioritize your code's security and privacy. Your code is not stored on our servers and is only temporarily processed for conversion. We use OpenAI's secure servers for the conversion process, ensuring your code remains confidential.

About Rust

Rust is a multi-paradigm programming language focused on performance and safety, especially safe concurrency.

About Haskell

Haskell is a purely functional programming language.

Palindrome Check Example: Rust vs Haskell

Palindrome Check in Rust

fn is_palindrome(s: &str) -> bool {
    let clean: String = s.chars()
        .filter(|c| c.is_alphanumeric())
        .map(|c| c.to_ascii_lowercase())
        .collect();
    
    clean.chars().eq(clean.chars().rev())
}

fn main() {
    println!("{}", is_palindrome("A man, a plan, a canal: Panama")); // true
    println!("{}", is_palindrome("race a car")); // false
}

Palindrome Check in Haskell

import Data.Char (isAlphaNum, toLower)

isPalindrome :: String -> Bool
isPalindrome str = clean == reverse clean
  where clean = map toLower $ filter isAlphaNum str

main :: IO ()
main = do
  print $ isPalindrome "A man, a plan, a canal: Panama" -- True
  print $ isPalindrome "race a car" -- False

Bubble Sort Example: Rust vs Haskell

Bubble Sort in Rust

fn bubble_sort(arr: &mut [i32]) {
    let n = arr.len();
    for i in 0..n {
        for j in 0..n - i - 1 {
            if arr[j] > arr[j + 1] {
                arr.swap(j, j + 1);
            }
        }
    }
}

fn main() {
    let mut arr = vec![64, 34, 25, 12, 22, 11, 90];
    bubble_sort(&mut arr);
    println!("{:?}", arr);
}

Bubble Sort in Haskell

bubbleSort :: Ord a => [a] -> [a]
bubbleSort xs = foldr (\_ -> bubble) xs [1..length xs - 1]
  where
    bubble [] = []
    bubble [x] = [x]
    bubble (x:y:xs)
      | x > y     = y : bubble (x:xs)
      | otherwise = x : bubble (y:xs)

main :: IO ()
main = print $ bubbleSort [64, 34, 25, 12, 22, 11, 90]