Siirry suoraan sisältöön
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
Tallenna

Games and Full Abstraction for a Functional Metalanguage with Recursive Types

In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59].
Kirjailija
Guy McCusker
Painos
Softcover reprint of the original 1st ed. 1998
ISBN
9781447111658
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
23.10.2012
Sivumäärä
189