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

  • Home
  • SEARCH
  • 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 6558469
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T13:12:13+00:00 2026-05-25T13:12:13+00:00

In SML, it’s common and easy to define a function using both currying and

  • 0

In SML, it’s common and easy to define a function using both currying and pattern matching. Here’s a simple example:

fun zip [] _ = []
  | zip _ [] = []
  | zip (x::xs) (y::ys) = (x,y)::(zip xs ys)

Ignoring library functions, what’s the best way to port this to OCaml? As far as I can tell, there is no easy way to declare a function using both currying and pattern matching.

  • 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-25T13:12:14+00:00Added an answer on May 25, 2026 at 1:12 pm

    I would say it’s best to just use a match expression.

    let rec zip xs ys = 
        match xs, ys with
        | [], _
        | _, [] -> []
        | x :: xs, y :: ys -> (x, y) :: zip xs ys
    

    If you’re set on not using match, it’s a bit convoluted, but you can do this.

    let rec zip = function
        | [] -> (fun _ -> [])
        | x :: xs ->
            function 
            | [] -> []
            | y :: ys -> (x, y) :: zip xs ys
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I was trying to make a tail-recursive version of this very simple SML function:
I need to write a very simple function in SML. It should check if
I'm having trouble with pattern matching with lists in SML. I'm trying to create
I am attempting to compare files in a directory using SML. Using the TextIO
I wonder how people handle nonexhaustive match warnings in the SML/NJ compiler. For example,
The standard SML library function Int.toString prefixes negative numbers with ~ instead of -
I'm having some trouble using SML/NJ interactive system, namely, that when I try to
I have an assignment where I need to implement church numerals in SML using
i want to write a function that checks for equality of lists in SML
I'm getting what seems to be a precedence issue in calling an SML function,

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.