«
»

Compatibility of equalities based on operational semantics

October 29th, 2010 by Nils Anders Danielsson

Today we discussed the kind of issues one can run into when proving that a program equivalence, defined on top of an operational semantics, is a congruence.

This entry was posted on Friday, October 29th, 2010 at 3:23 pm and is filed under Lunches. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

3 Responses to “Compatibility of equalities based on operational semantics”

  1. Bob Harper Says:
    October 29th, 2010 at 7:25 pm

    And what came of it?

  2. Neel Krishnaswami Says:
    November 5th, 2010 at 8:03 pm

    I’ll second that question!

  3. Nils Anders Danielsson Says:
    November 30th, 2010 at 5:18 pm

    I can only recall one “new” thing being mentioned: It is unclear if Howe’s method can be adapted (in a reasonably elegant way) to operational semantics defined using the partiality monad.

Leave a Reply