Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 1044645
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 16, 20262026-05-16T15:51:37+00:00 2026-05-16T15:51:37+00:00

Is there an OCaml equivalent to Haskell’s pattern matching on an arbitrary number of

  • 0

Is there an OCaml equivalent to Haskell’s pattern matching on an arbitrary number of arguments? For example, can I have something resembling:

merge [] lst = lst
merge lst [] = lst
merge l1 @ (n : ns) l2 @ (m : ms) = 
  if n < m then n : merge ns l2 else m : merge l1 ms

(The example’s lifted from Developing Applications with Objective Caml 🙂

Thanks.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-16T15:51:38+00:00Added an answer on May 16, 2026 at 3:51 pm

    You can’t match multiple arguments as such, but you can match tuples, so you can do:

    let rec merge l1 l2 = match l1, l2 with
    | [], lst
    | lst, [] -> lst
    | (n::ns), (m::ms) -> if n < m then n :: merge ns l2 else m :: merge l1 ms
    

    If you’re ok with the function taking its arguments as a tuple you can also use function like this:

    let rec merge = function
    | [], lst
    | lst, [] -> lst
    | (n::ns as l1), (m::ms as l2) -> if n < m then n :: merge (ns, l2) else m :: merge (l1, ms)
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a recursive immutable data structure in ocaml which can be simplified to
If I have an object, how can I determine its type? (Is there an
Recently I was introduced to this OCaml code which in Haskell can be written
There is series of functions like print_int, print_endline and Printf in OCaml. I can't
In the OCaml world at present there appear to be a number of competing
Is there a standard way in Ocaml, to convert from (for example) a\n (a
I am working on a project with OCaml and there are some problems regarding
What OCaml libraries are out there that provide lazy list handling? I am looking
In Ocaml, is there easier ways to write a graphics-based toy programs like deminer
Are there hashtables in Ocaml that use == instead of = when testing for

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.