| Автор | RIECKE, JON G. |
| Автор | SUBRAHMANYAM, RAMESH |
| Дата выпуска | 1999 |
| dc.description | We consider the following question: in the simply-typed λ-calculus with algebraic operations, is the set of equations valid in a particular model exactly those provable from (β), (η) and the set of algebraic equations, E, that are valid in the model? We find conditions for determining whether βηE-equational reasoning is complete. We demonstrate the utility of the results by presenting a number of simple corollaries for particular models. |
| Издатель | Cambridge University Press |
| Название | Conditions for the completeness of functional and algebraic equational reasoningA preliminary version titled ‘Algebraic Reasoning and Completeness in Typed Languages’ appeared in Twentieth ACM Conference on Principles of Programming Languages, pages 185–195, ACM Press, 1993. |
| Electronic ISSN | 1469-8072 |
| Print ISSN | 0960-1295 |
| Журнал | Mathematical Structures in Computer Science |
| Том | 9 |
| Первая страница | 651 |
| Последняя страница | 685 |
| Аффилиация | RIECKE JON G.; Bell Laboratories, Lucent Technologies |
| Аффилиация | SUBRAHMANYAM RAMESH; Wesleyan University; Lucent Technologies |
| Выпуск | 6 |
