Foundational Aspects of Syntax

ACM Computing Surveys

Volumn 31, Issue , 1999, Pages 11-

  Miller, Dale ^a   Palamidessi, Catuscia ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937449491     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/333580.333590     Document Type: Article

References (17)

1. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
2. J. F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202-260, 1992.
3. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, 1993.
4. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
5. R. McDowell. Reasoning in a Logic with Definitions and Induction. PhD thesis, University of Pennsylvania, December 1997. 60 D. Miller and C. Palamidessi
6. R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In Glynn Winskel, editor, Proceedings of teh 1997 Symposium on Logic and Computer Science, 1997.
7. D. Miller and G. Nadathur. A logic programming approach to manipulating for mulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, 379-388, San Francisco, 1987.
8. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
9. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part II. Information and Computation, pages 41-77, September 1992.
10. T. Nipkow. Higher-order critical pairs. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 342-349. IEEE, July 1991.
11. G. Nadathur and D. Miller. An Overview of AProlog. In Fifth International Logic Programming Conference, pages 810-827, Seattle, Washington, August 1988. MIT Press.
12. G. Nadathur and D. S. Wilson. A Notation for Lambda Terms: A Generalization of Environments. Theoretical Computer Science 198(1-2): 49-98 (1998).
13. L. C. Paulson. Isabelle: The next 700 theorem provers. In Piergiorgio Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
14. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proceedings of the ACMSIGPLAN Conference on Programming Language Design and Implementation,199- 208. ACM Press, 1988.
15. F. Pfenning. Elf: A language for logic definition and verified metaprogramming. In Fourth Annual Symposium on Logic in Computer Science, pages 313-321, Monterey, CA, June 1989.
16. Z. Qian. Linear unification of higher-order patterns. In J.-P. Jouannaud, editor, Proc. 1993 Coll. Trees in Algebra and Programming. Springer Verlag LNCS, 1993.
17. D. Sangiorgi. n-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2):235-274, 1996.