Abstract | ||
---|---|---|
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to define in Z much of its own schema calculus and refinement rules. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1007/3-540-44525-0_15 | ZB |
Keywords | Field | DocType |
refinement rule,generic parameter,type-constrained generics,own schema calculus,z notation,type system | Discrete mathematics,Logical connective,Computer science,Schema (psychology) | Conference |
ISBN | Citations | PageRank |
3-540-67944-8 | 1 | 0.40 |
References | Authors | |
5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Samuel H. Valentine | 1 | 62 | 10.14 |
Ian Toyn | 2 | 170 | 22.66 |
Susan Stepney | 3 | 813 | 113.21 |
Steve King | 4 | 3 | 0.83 |