Name
Abstract | ||
|---|---|---|
We show how to use intersection types for building models of a @l-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.entcs.2005.06.017 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
recursive term,interesting consistency result,intended meaning,minimal fixed point,type preorders,intersection types,fixed points,λ -models,recursive terms,easy terms,intersection type,fixed point | Discrete mathematics,Computer science,Fixed point,Recursion | Journal |
Volume | ISSN | Citations |
136, | Electronic Notes in Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabio Alessi | 1 | 83 | 12.04 |
| Mariangiola Dezani-Ciancaglini | 2 | 1615 | 193.57 |