Eureka definitions for free! or Disagreement points for fold/unfold transformations
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 291-305
- https://doi.org/10.1007/3-540-52592-0_70
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Theorems for free!Published by Association for Computing Machinery (ACM) ,1989
- Transformations on higher-order functionsPublished by Association for Computing Machinery (ACM) ,1989
- Separating binding times in language specificationsPublished by Association for Computing Machinery (ACM) ,1989
- Automatic binding time analysis for a typed λ-calculusPublished by Association for Computing Machinery (ACM) ,1988
- Compilers and staging transformationsPublished by Association for Computing Machinery (ACM) ,1986
- Miranda: A non-strict functional language with polymorphic typesLecture Notes in Computer Science, 1985
- A System for Assisting Program TransformationACM Transactions on Programming Languages and Systems, 1982
- Compiler Specification and VerificationPublished by Springer Nature ,1981
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- On the relation between direct and continuation semanticsPublished by Springer Nature ,1974