Name
Abstract | ||
|---|---|---|
this paper we show how norms can be generated from the prescribed types of a programwritten in a language which supports parametric polymorphism, e.g. Godel [11]. Interestingly,the types highlight restrictions of earlier norms and suggest how these norms can be extended toobtain some very general and powerful notions of norm which can be used to measure any term inan almost arbitrary way. We see our work on norm derivation as a contribution to the terminationanalysis of typed logic... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-62718-9_13 | LOPSTR |
Keywords | Field | DocType |
typed norms,typed logic programs,parametric polymorphism | Logic program,Programming language,Typed lambda calculus,Computer science,Algorithm,Norm (social),Theoretical computer science,Exploit,Termination analysis,Strong and weak typing,Logic programming,Computer programming | Conference |
Volume | ISSN | ISBN |
1207 | 0302-9743 | 3-540-62718-9 |
Citations | PageRank | References |
14 | 0.79 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan C. Martin | 1 | 29 | 2.19 |
| Andy King | 2 | 170 | 11.03 |
| Paul Soper | 3 | 158 | 55.78 |