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 9143787
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 17, 20262026-06-17T10:06:39+00:00 2026-06-17T10:06:39+00:00

I am currently trying to create a (sort of) typesafe xml like syntax embedded

  • 0

I am currently trying to create a (sort of) typesafe xml like syntax embedded into Haskell. In the end I am hoping to achieve something like this:

tree = group [arg1 "str", arg2 42] 
         [item [foo, bar] []
         ,item [foo, bar] []
         ]

where group and item are of kind Node :: [Arg t] -> [Node c] -> Node t. If this doesn’t make any sense it is most probably because I have no idea what I am doing 🙂

My question now is how to make the type system prevent me from giving ‘wrong’ arguments to a Node. Eg Nodes of type Group only may have arguments of type Arg1 and Arg2 but Items may have arguments of type Foo and Bar.

I guess the bottom line question is: how do i restrict the types in a heterogenous list?


Example of the (user) syntax i am trying to achieve:

group .: arg1 "str" .: arg2 42
    item .: foo .: bar
    item .: foo .: bar

where (.:) is a function that sets the parameter in the node. This would represent a group with some parameters containing two items.

Additionally there would be some (pseudo) definition like:

data Node = Node PossibleArguments PossibleChildNodes

type Group = Node [Arg1, Arg2] [Item]
type Item  = Node [Foo, Bar] []

I am searching for a way to catch usage errors by the typechecker.

  • 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-06-17T10:06:40+00:00Added an answer on June 17, 2026 at 10:06 am

    Based on the ensuing discussion, it sounds like what you want is to create a DSL (Domain-Specific Language) to represent XML.

    One option is to embed your DSL in Haskell so it can appear in Haskell source code. In general, you can do this by defining the types you need, and providing a set of functions to work with those types. It sounds like this is what you’re hoping to do. However, as an embedded DSL, it will be subject to some constraints, and this is the problem you’re encountering. Perhaps there is a clever trick to do what you want, maybe something involving type functions, but I can’t think of anything at present. If you want to keep trying, maybe add the tags dsl and gadt to your question, catch the attention of people who know more about this stuff than I do. Alternatively, you might be able to use something like Template Haskell or Scrap Your Boilerplate to allow your users to omit some information, which would them be “filled in” before Haskell “sees” it.

    Another option is to have an external DSL, which you parse using Haskell. You could define a DSL, but maybe it would be easier to just use XML directly with a suitable DTD. There are Haskell libraries for parsing XML, of course.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm currently trying to create a desktop like homepage where using can move around
I am currently trying to create a sort of tasktracker.. The following code works
I am currently trying to create some sort of label that when you hover
I'm trying to store a callback in a class. Currently, I do something like
I'm currently trying to create a template in TextMate. The template is very basic:
I'm currently trying to create an email application using Rails and Sendgrid. This application
I'm currently trying to create a program that estimates location based on signal strength.
I am currently trying to create a function which will allow me to pass
I am currently trying to create an Android application that loops Audio from the
I'm currently trying to create a subclass of UIImageView in order to make it

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.