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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T07:58:43+00:00 2026-06-18T07:58:43+00:00

Hi the question is as following: Assume we have processes A and B which

  • 0

Hi the question is as following:
Assume we have processes A and B which are linked. Process’s A flag trap_exit is set to true. Let B process send a msg to A and then exit:

PidA ! 'msg',
exit(reason).

What I wanna know if we can be shure that the process A will receive ‘msg’ and only after It {‘EXIT’, Pid, reason} will come ? Can we predict the ordering of msgs? I can’t found any proofs in documentation, but I guess that it will work that way, but I need some proofs. Don’t want to have race condition here..

  • 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-18T07:58:45+00:00Added an answer on June 18, 2026 at 7:58 am

    As to not leave this question hanging. This is the discussion in erlang-questions mailing list:

    http://thread.gmane.org/gmane.comp.lang.erlang.general/66788

    Long story short: all messages are signals (or all signals are messages), exits are seen as messages from the process, guaranteed to arrive in the same order they were sent.

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

Sidebar

Related Questions

I have the following question: Let's assume the code below: ... <h:form id=..> <table>
I have the following question. Assume we have third party software that send us
I have the following question. I have a set of Fortran90 source files, most
Let's assume we have the following generic scenario: An RDBMS as a data source,
I have the following question: Assume base class A with method: A& operator+(A& a)
Let assume we have such URL: dvb://1.3f3.255c.15 my question is how to parse this
Let's assume we have the following class : public class ImageButton extends MovieClip {
Hopefully, this won't be a silly question. Assume I have the following model: var
I have following question on adobe omniture How we can register an iPhone app
I have the following question, and it screams at me for a solution with

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.