Free Online Swift to Haskell Code Converter

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

How to Use Our Swift to Haskell Code Converter

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

Is Our Swift 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 Swift

Swift is a general-purpose, multi-paradigm, compiled programming language developed by Apple Inc. and the open-source community.

About Haskell

Haskell is a purely functional programming language.

Palindrome Check Example: Swift vs Haskell

Palindrome Check in Swift

func isPalindrome(_ str: String) -> Bool {
    let clean = str.lowercased().filter { $0.isLetter || $0.isNumber }
    return clean == String(clean.reversed())
}

# Example usage
print(isPalindrome("A man, a plan, a canal: Panama")) // true
print(isPalindrome("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: Swift vs Haskell

Bubble Sort in Swift

func bubbleSort(_ arr: inout [Int]) {
    let n = arr.count
    for i in 0..<n {
        for j in 0..<(n - i - 1) {
            if arr[j] > arr[j + 1] {
                arr.swapAt(j, j + 1)
            }
        }
    }
}

# Example usage
var arr = [64, 34, 25, 12, 22, 11, 90]
bubbleSort(&arr)
print(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]