Deriving mixed evaluation from standard evaluation for a simple functional language
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 239-255
- https://doi.org/10.1007/3-540-51305-1_13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Specifying theorem provers in a higher-order logic programming languagePublished by Springer Nature ,2005
- Partial evaluation with inference rulesNew Generation Computing, 1988
- Higher-order abstract syntaxPublished by Association for Computing Machinery (ACM) ,1988
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988
- A natural deduction treatment of operational semanticsPublished by Springer Nature ,1988
- Symbolic evaluation with structural recursive symbolic constantsScience of Computer Programming, 1987
- Partial evaluation and ω-completeness of algebraic specificationsTheoretical Computer Science, 1986
- Logical relations and the typed λ-calculusInformation and Control, 1985
- Proving and applying program transformations expressed with second-order patternsActa Informatica, 1978
- 3. Investigations into Logical DeductionPublished by Elsevier ,1969