Encoding generic judgments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2556 LNCS, Issue , 2002, Pages 18-32

  Miller, Dale ^a   Tiu, Alwen ^b  

^a INRIA   (France)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; ENCODING (SYMBOLS); LOGIC PROGRAMMING; SEMANTICS; SIGNAL ENCODING; SOFTWARE ENGINEERING;

BOUND VARIABLES; COMPUTATION SYSTEMS; GENERIC JUDGMENTS; INFERENCE RULES; LAMBDA ABSTRACTION; LOGICAL THEORIES; OPERATIONAL SEMANTICS; PI CALCULUS; HORN CLAUSE;

ABSTRACTING;

EID: 84877774131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_3     Document Type: Conference Paper

References (37)

1. Jawahar Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, February 1995.
2. Jolle Despeyroux. A higher-order specification of the π-calculus. In Proc. of the IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, August 17-19, 2000., August 2000.
3. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In 14th Annual Symposium on Logic in Computer Science, pages 193-202. IEEE Computer Society Press, 1999.
4. Jean-Yves Girard. A fixpoint theorem in linear logic. Email to the lin-ear@cs.stanford.edu mailing list, February 1992.
5. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In 14th Annual Symposium on Logic in Computer Science, pages 214-224. IEEE Computer Society Press, 1999.
6. Furio Honsell, Marino Miculan, and Ivan Scagnetto. Pi-calculus in (co)in-ductive type theory. TCS, 253(2):239-285, 2001.
7. M. Hofmann. Semantical analysis of higher-order abstract syntax. In 14th Annual Symposium on Logic in Computer Science, pages 204-213. IEEE Computer Society Press, 1999.
8. Lars Hallnäs and Peter Schroeder-Heister. A proof-theoretic approach to logic programming. ii. Programs as definitions. Journal of Logic and Computation, 1(5):635-660, October 1991.
9. Gérard Huet. A unification algorithm for typed λ-calculus. TCS, 1:27-57, 1975.
10. Gilles Kahn. Natural semantics. In Proc. of the Symposium on Theoretical Aspects of Computer Science, volume 247 of LNCS, pages 22-39. March 1987.
11. Raymond McDowell. Reasoning in a Logic with Definitions and Induction. PhD thesis, University of Pennsylvania, December 1997.
12. Dale Miller. Abstractions in logic programming. In Piergiorgio Odifreddi, editor, Logic and Computer Science, pages 329-359. Academic Press, 1990.
13. Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
14. Dale Miller. Unification of simply typed lambda-terms as logic programming. In Eighth International Logic Programming Conference, pages 255-269, Paris, France, June 1991. MIT Press.
15. Dale Miller. Forum: A multiple-conclusion specification language. TCS, 165(1):201-232, September 1996.
16. Dale Miller. Abstract syntax for variable binders: An overview. In John Lloyd and et. al., editors, Computational Logic - CL 2000, number 1861 in LNAI, pages 239-253. Springer, 2000.
17. Dale Miller. Encoding generic judgments: Preliminary results. In R.L. Crole S.J. Ambler and A. Momigliano, editors, ENTCS, volume 58. Elsevier, 2001. Proceedings of the MERLIN 2001 Workshop, Siena.
18. Raymond McDowell and Dale Miller. A logic for reasoning with higher-order abstract syntax. In Glynn Winskel, editor, Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 434-445, Warsaw, Poland, July 1997. IEEE Computer Society Press.
19. Raymond McDowell and Dale Miller. Cut-elimination for a logic with definitions and induction. TCS, 232:91-119, 2000.
20. Raymond McDowell and Dale Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic, 3(1):80-136, January 2002.
21. Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. TCS, 197(1-2), 2001. To appear.
22. Dale Miller and Gopalan Nadathur. A computational logic approach to syntax and semantics. Presented at the Tenth Symposium of the Mathematical Foundations of Computer Science, IBM Japan, May 1985.
23. Dale Miller and Gopalan Nadathur. Some uses of higher-order logic in computational linguistics. In Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, pages 247-255. Association for Computational Linguistics, Morristown, New Jersey, 1986.
24. Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, pages 379-388, San Francisco, September 1987.
25. Dale Miller and Catuscia Palamidessi. Foundational aspects of syntax. In Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, and Peter Wegner, editors, ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, volume 31. ACM, Sep 1999.
26. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Part II. Information and Computation, pages 41-77, 1992.
27. Tobias Nipkow. Higher-order critical pairs. In G. Kahn, editor, LICS91, pages 342-349. IEEE, July 1991.
28. Gopalan Nadathur and Dustin J. Mitchell. System description: Teyjus - a compiler and abstract machine based implementation of Lambda Prolog. In H. Ganzinger, ed., CADE16, pages 287-291, Trento, Italy, July 1999. LNCS.
29. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, September 1989.
30. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, June 1988.
31. G. Plotkin. A structural approach to operational semantics. DAIMI FN-19, Aarhus University, Aarhus, Denmark, September 1981.
32. C. Röckl, D. Hirschkoff, and S. Berghofer. Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts. In Proceedings of FOSSACS'01, LNCS, 2001.
33. Davide Sangiorgi. π-calculus, internal mobility and agent-passing calculi. TCS, 167(2):235-274, 1996.
34. Peter Schroeder-Heister. Cut-elimination in logics with definitional reflection. In D. Pearce and H. Wansing, editors, Nonclassical Logics and Information Processing, volume 619 of LNCS, pages 146-171. Springer, 1992.
35. Peter Schroeder-Heister. Rules of definitional reflection. In M. Vardi, editor, Eighth Annual Symposium on Logic in Computer Science, pages 222-232. IEEE Computer Society Press, IEEE, June 1993.
36. Alwen F. Tiu. An extension of L-lambda unification. Draft, available via http://www.cse.psu.edu/~tiu/llambdaext.pdf, September 2002.
37. Jérémie D. Wajs. Reasoning about Logic Programs Using Definitions and Induction. PhD thesis, Pennsylvania State University, 2002.