Name
Abstract | ||
|---|---|---|
This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a recursively defined function: one is for its recursive calls and the other is for its calls outside its definition. Bimorphic recursion in this paper can be nested. This paper shows bimorphic recursion has principal types and decidable type inference. Hence bimorphic recursion gives us flexible typing for recursion with decidable type inference. This paper also shows that its typability becomes undecidable because of nesting of recursions when one removes the instantiation property from the bimorphic recursion. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.4204/EPTCS.54.8 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
programming language,polymorphism,type inference | Discrete mathematics,Recursion (computer science),Functional programming,Type inference,Mutual recursion,Polymorphic recursion,Double recursion,Left recursion,Mathematics,Recursion | Journal |
Issue | ISSN | Citations |
54 | 2075-2180 | 0 |
PageRank | References | Authors |
0.34 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Makoto Tatsuta | 1 | 111 | 22.36 |
| Ferruccio Damiani | 2 | 989 | 71.30 |