Name
Abstract | ||
|---|---|---|
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/BFb0035757 | ICALP |
Keywords | Field | DocType |
strong normalization,polymorphic rewriting conserves algebraic,higher order,lambda calculus,polymorphism | Discrete mathematics,Lambda calculus,Algebraic number,Normalization (statistics),Normalization property,Rewriting,Confluence,Mathematics,Lambda | Conference |
Volume | ISSN | ISBN |
372 | 0302-9743 | 3-540-51371-X |
Citations | PageRank | References |
22 | 2.99 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Val Tannen | 1 | 2367 | 518.95 |
| Jean H. Gallier | 2 | 749 | 111.86 |