Higher-Order Abstract Syntax

ACM SIGPLAN Notices

Volumn 23, Issue 7, 1988, Pages 199-208

  Pfenning, Frank ^a   Elliot, Conal ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976669166     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/960116.54010     Document Type: Article

References (20)

1. Arnon Avron, Furio A. Honsell, and Ian A. Mason. Using typed Lambda Calculus to Implement Formal Systems on a Machine. Technical Report ECSLFCS-87-31, Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland, June 1987.
2. Rolf Bahlke and Gregor Snelting. The PSG system: from formal language definitions to interactive programming environments. ACM Transactions on Programming Languages and Systems, 8(4):547– 576, October 1986.
3. R. M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1):44–67, January 1977.
4. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
5. N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381–392, 1972.
6. David Garlan. Views for Tools in Integrated Environments. PhD thesis, Carnegie Mellon University, 1987. Available as Technical Report CMU-CS-87-147.
7. Timothy G. Griffin. An Environment for Formal Systems. Technical Report 87-846, Department of Computer Science, Cornell University, Ithaca, New York, June 1987.
8. Gandalf Group. Special issue on the Gandalf project. In The Journal of Systems and Software, Volume 5, Number 2, May 1985.
9. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. In Symposium on Logic in Computer Science, pages 194–204, IEEE, June 1987.
10. Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.
11. Gérard Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31–55, 1978.
12. Dale Miller, Gopalan Nadathur, and Andre Scedrov. Hereditary Harrop formulas and uniform proof systems. In Second Annual Symposium on Logic in Computer Science, pages 98–105, IEEE, June 1987.
13. Dale A. Miller. Unification under mixed prefixes. 1987. Unpublished manuscript.
14. Dale A. Miller and Gopalan Nadathur. Higher-order logic programming. In Proceedings of the Third International Conference on Logic Programming, Springer Verlag, July 1986.
15. Dale A. Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Symposium on Logic Programming, San Francisco, IEEE, September 1987.
16. B. Möller. A survey of the project CIP: Computer-aided, intuition-guided programming. Technical Report TUM-18406, Institut für Informatik der TU München, Munich, West Germany, 1984.
17. Gopalan Nadathur. A Higher-Order Logic as the Basis for Logic Programming. PhD thesis, University of Pennsylvania, 1987.
18. Lawrence Paulson. Natural deduction as higher-order resolution. Journal of Logic Programming, 3:237-258, 1986.
19. Thomas Reps and Tim Teitelbaum. The synthesizer generator. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 42–48, ACM, New York, April 1984.
20. David S. Wile. POPART: Producer of Parsers and Related Tools, System Builder’s Manual. Technical Report, University of Southern California, Information Sciences Institute, 1987.