Free Online Delphi to Haskell Code Converter

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

How to Use Our Delphi to Haskell Code Converter

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

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

Delphi is an event-driven programming language based on Object Pascal.

About Haskell

Haskell is a purely functional programming language.

Palindrome Check Example: Delphi vs Haskell

Palindrome Check in Delphi

function IsPalindrome(const S: string): Boolean;
var
  CleanStr: string;
  I: Integer;
begin
  // Remove non-alphanumeric characters and convert to lowercase
  CleanStr := '';
  for I := 1 to Length(S) do
    if S[I].IsLetterOrDigit then
      CleanStr := CleanStr + S[I].ToLower;

  // Check if the string is equal to its reverse
  Result := CleanStr = ReverseString(CleanStr);
end;

// Example usage
WriteLn(IsPalindrome('A man, a plan, a canal: Panama'));  // True
WriteLn(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: Delphi vs Haskell

Bubble Sort in Delphi

procedure BubbleSort(var Arr: array of Integer);
var
  I, J, Temp: Integer;
begin
  for I := High(Arr) downto Low(Arr) do
    for J := Low(Arr) to I - 1 do
      if Arr[J] > Arr[J + 1] then
      begin
        Temp := Arr[J];
        Arr[J] := Arr[J + 1];
        Arr[J + 1] := Temp;
      end;
end;

// Example usage
var
  Arr: array of Integer;
begin
  SetLength(Arr, 7);
  Arr[0] := 64; Arr[1] := 34; Arr[2] := 25; Arr[3] := 12;
  Arr[4] := 22; Arr[5] := 11; Arr[6] := 90;

  WriteLn('Original array:');
  PrintArray(Arr);

  BubbleSort(Arr);

  WriteLn('Sorted array:');
  PrintArray(Arr);
end;

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]