Efficient type inference for higher-order binding-time analysis
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 448-472
- https://doi.org/10.1007/3540543961_22
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Two-level semantics and code generationTheoretical Computer Science, 1988
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988
- New insights into partial evaluation: the SCHISM experimentPublished by Springer Nature ,1988
- The structure of a self-applicable partial evaluatorPublished by Springer Nature ,1986
- An experiment in partial evaluationACM SIGPLAN Notices, 1985
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Linear unificationJournal of Computer and System Sciences, 1978
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972