Paper Info
Title
A Game Semantics for Generic Polymorphism
Abstract
Abstract: Genericity is the idea that the same program can work atmany dierent data types. Longo, Milsted and Soloviev proposed to capturethe inability of generic programs to probe the structure of theirinstances by the following equational principle: if two generic programs,viewed as terms of type 8X: A[X], are equal at any given instance A[T ],then they are equal at all instances. They proved that this rule is admissiblein a certain extension of System F, butnding a semantically...
Year
DOI
Venue
2013
10.1007/3-540-36576-1_1
Foundations of Software Science and Computation Structure
Keywords
DocType
Volume
game semantics,generic programming,model building,polymorphism,satisfiability,data type
Journal
abs/1312.1120
Issue
ISSN
ISBN
1-3
Annals of Pure and Applied Logic, vol 133, 3-37, 2005
3-540-00897-7
Citations 
PageRank 
References 
7
0.62
17
Authors
2
Name
Order
Citations
PageRank
Samson Abramsky13169348.51
Radha Jagadeesan22117121.75