Assignment 3.3

Moderator: Type Systems of Programming Languages

aloifolia
Mausschubser
Mausschubser
Beiträge: 63
Registriert: 22. Sep 2011 11:37

Assignment 3.3

Beitrag von aloifolia »

What are the reduction rules that we can suppose to be given as basis? E.g. is there already some R-Eq or T-Eq? Or does T-Eq'' replace T-Eq?

For assignment 3.2 I just defined the basis on my own in order to be able to argue decently.

erdweg
Moderator
Moderator
Beiträge: 60
Registriert: 28. Mär 2013 10:08

Re: Assignment 3.3

Beitrag von erdweg »

You should assume the standard reduction rules for all syntactic constructs (including EQ) and standard type rules for arithmetics and booleans.

Sebastian

aloifolia
Mausschubser
Mausschubser
Beiträge: 63
Registriert: 22. Sep 2011 11:37

Re: Assignment 3.3

Beitrag von aloifolia »

Okiedokie, that is what I already did anyway.

By the way: Wouldn't it be beneficial to have the different variants of our language defined formally in some ressource that is available to everyone? In the class lectures we often do it more informally which is fine then but complicates things when you want to look something up. And the book introduces different rules which is why it cannot be used as a reference either.

erdweg
Moderator
Moderator
Beiträge: 60
Registriert: 28. Mär 2013 10:08

Re: Assignment 3.3

Beitrag von erdweg »

Good idea. I am happy to review and publish any such resource, but I don't have time to prepare it myself.

Sebastian

aloifolia
Mausschubser
Mausschubser
Beiträge: 63
Registriert: 22. Sep 2011 11:37

Re: Assignment 3.3

Beitrag von aloifolia »

Ok I will then try to write such definition down beginning in the next or the following week.

Antworten

Zurück zu „Type Systems of Programming Languages“