Foundational aspects of syntax

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Foundational aspects of syntax

Full text

Pdf (162 KB)

Source

ACM Computing Surveys (CSUR) archive
Volume 31 , Issue 3es (September 1999) table of contents

Article No. 11

Year of Publication: 1999

ISSN:0360-0300

Authors

Dale Miller	Department of Computer Science and Engineering, The Pennsylvania State University, 220 Pond Laboratory, University Park, PA
Catuscia Palmidessi	Department of Computer Science and Engineering, The Pennsylvania State University, 220 Pond Laboratory, University Park, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 37, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/333580.333590 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
	2	Jan Friso Groote , Frits Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation, v.100 n.2, p.202-260, Oct. 1992 [doi>10.1016/0890-5401(92)90013-6]
	3	Robert Harper , Furio Honsell , Gordon Plotkin, A framework for defining logics, Journal of the ACM (JACM), v.40 n.1, p.143-184, Jan. 1993 [doi>10.1145/138027.138060]
	4	Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
	5	Raymond Charles Mcdowell , Dale Miller, Reasoning in a logic with definitions and induction, 1997
	6	Raymond McDowell , Dale Miller, A Logic for Reasoning with Higher-Order Abstract Syntax, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, p.434, June 29-July 02, 1997
	7	Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, 379-388, San Francisco, 1987.
	8	Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
	9	Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, II, Information and Computation, v.100 n.1, p.41-77, Sept. 1992 [doi>10.1016/0890-5401(92)90009-5]
	10	Tobias Nipkow. Higher-order critical pairs. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 342-349. IEEE, July 1991.
	11	Gopalan Nadathur and Dale Miller. An Overview of AProlog. In Fifth International Logic Programming Conference, pages 810-827, Seattle, Washington, August 1988. MIT Press.
	12	Gopalan Nadathur , Debra Sue Wilson, A notation for lambda terms. A generalization of environment, Theoretical Computer Science, v.198 n.1-2, p.49-98, May 30, 1998 [doi>10.1016/S0304-3975(97)00184-9]
	13	Lawrence 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 , C. Elliot, Higher-order abstract syntax, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.199-208, June 20-24, 1988, Atlanta, Georgia, United States
	15	F. Pfening, Elf: a language for logic definition and verified metaprogramming, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.313-322, June 1989, Pacific Grove, California, United States
	16	Zhenyu Qian, Linear Unification of Higher-Order Patterns, Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.391-405, April 13-17, 1993
	17	Davide Sangiorgi, &pgr;-calculus, internal mobility, and agent-passing calculi, Theoretical Computer Science, v.167 n.1-2, p.235-274, Oct. 30, 1996

CITED BY 3

	Marino Miculan , Ivan Scagnetto , Furio Honsell, Translating specifications from nominal logic to CIC with the theory of contexts, Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, p.41-49, September 30-30, 2005, Tallinn, Estonia
	Alwen Tiu, A Logic for Reasoning about Generic Judgments, Electronic Notes in Theoretical Computer Science (ENTCS), v.174 n.5, p.3-18, June, 2007
	Alwen Tiu, On the Role of Names in Reasoning about λ-tree Syntax Specifications, Electronic Notes in Theoretical Computer Science (ENTCS), 228, p.135-150, January, 2009