Very Efficient Conversions

@inproceedings{Welinder1995VeryEC,
  title={Very Efficient Conversions},
  author={Morten Welinder},
  booktitle={TPHOLs},
  year={1995}
}
Using program transformation techniques from the field of partial evaluation an automatic tool for generating very efficient conversions from equality-stating theorems has been implemented. 
Transparent Optimisation of Rewriting Combinators
Generating Embeddings from Denotational Descriptions
A Temporal Logic Approach to Binding-Time Analysis
A temporal-logic approach to binding-time analysis
  • Rowan Davies
  • Mathematics, Computer Science
  • Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
Partial Evaluation and Correctness

References

SHOWING 1-9 OF 9 REFERENCES
Partial evaluation and automatic program generation
Efficiency in a fully-expansive theorem prover
A Higher-Order Implementation of Rewriting
Hand-Writing Program Generator Generators
Simplifying Deep Embedding: A Formalised Code Generator
Handwriting program generator generators Programming Language Implementation and Logic Programming
  • 6th International Symposium , PLILP '94
  • 1994
Introduction to HOL
  • Introduction to HOL
  • 1993