Partial type assignment in left linear applicative term rewriting systems
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 300-321
- https://doi.org/10.1007/3-540-55251-0_17
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Concurrent cleanPublished by Springer Nature ,1991
- A proper extension of ML with an effective type-assignmentPublished by Association for Computing Machinery (ACM) ,1988
- Clean — A language for functional graph rewritingPublished by Springer Nature ,1987
- Term graph rewritingPublished by Springer Nature ,1987
- Principles of OBJ2Published by Association for Computing Machinery (ACM) ,1985
- Miranda: A non-strict functional language with polymorphic typesLecture Notes in Computer Science, 1985
- Polymorphic type schemes and recursive definitionsPublished by Springer Nature ,1984
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965