Representing and reasoning with operational semantics

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

Volumn 4130 LNAI, Issue , 2006, Pages 4-20

  Miller, Dale ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; ENCODING (SYMBOLS); FORMAL LOGIC; METADATA; THEOREM PROVING;

LOGICAL ENCODINGS; META-LOGIC; OPERATIONAL SEMANTICS; SEMANTIC SPECIFICATIONS;

SEMANTICS;

EID: 33749550880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_3     Document Type: Conference Paper

References (56)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297-347, 1992.
2. B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, and S. Zdancewic. Mechanized metatheory for the masses: The PoplMark challenge. In Theorem Proving in Higher Order Logics: 18th International Conference, LNCS, pages 50-65. Springer-Verlag, 2005.
3. M. Boreale and R. D. Nicola. A symbolic semantics for the π-calculus. Information and Computation, 126(1):34-52, April 1996.
4. P. Borras, D. Clément, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pascual. Centaur: the system. In Proceedings of SIGSOFT'88: Third Annual Symposium on Software Development Environments (SDES), Boston, 1988.
5. N. Bruijn. Lambda calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Math., 40(3):348-356, 1979.
6. A. Church. A formulation of the simple theory of types. J.of Symbolic Logic, 5:56-68, 1940.
7. K. L. Clark. Negation as failure. In J. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
8. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
9. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76(2/3):95-120, February/March 1988.
10. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In Second International Conference on Typed Lambda Calculi and Applications, pages 124-138, April 1995.
11. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
12. G. Gentzen. Investigations into logical deductions. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68-131. North-Holland, Amsterdam, 1969.
13. J.-Y. Girard. A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu, February 1992.
14. M. Gordon. HOL: A machine oriented formulation of higher-order logic. Technical Report 68, University of Cambridge, July 1985.
15. J. F. Groote and F. Vaandrager. Structured operational semantics and bisiniulation as a congruence. Information and Computation, 100:202-260, 1992.
16. L. Hallnäs and P. Schroeder-Heister. A proof-theoretic approach to logic programming. II. Programs as definitions. J. of Logic and Computation, 1(5):635-660, October 1991.
17. M. Hennessy and H. Lin, Symbolic bisimulations. Theoretical Computer Science, 138(2);353-389, Feb. 1995.
18. M. Hofmann. Semantical analysis of higher-order abstract syntax. In 14th Symp. on Logic in Computer Science, pages 204-213. IEEE Computer Society Press, 1999.
19. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
20. G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Ada Informatica, 11:31-55, 1978.
21. J. Jaffar and J.-L. Lassez, Constraint logic programming. In Proceedings of the 14th ACM Symposium on the Principles of Programming Languages, 1987.
22. J. R. Kiniry, P. Chalin, and C. Hurlin. Integrating static checking and interactive verification: Supporting multiple theories and provers in verification. In VSTTE'05, Proceedings of Verified Software: Theories, Tools, Experiernents, Zurich, Switzerland, October 2005.
23. P. Martin-Löf. Constructive mathematics and computer programming. In Sixth International Congress for Logic, Methodology, and Philosophy of Science, pages 153-175, Amsterdam, 1982. North-Holland.
24. R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In G. Winskel, editor, 12th Symp. on Logic in Computer Science, pages 434-445, Warsaw, Poland, July 1997. IEEE Computer Society Press.
25. R. McDowell and D. Miller. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science, 232:91-119, 2000.
26. R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. on Computational Logic, 3(1):80-136, 2002.
27. R. McDowell, D. Miller, and C. Palamiclessi. Encoding transition systems in sequent calculus. Theoretical Computer Science, 294(3):411-437, 2003.
28. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. of Logic and Computation, 1(4):497-536, 1991.
29. D. Miller. Abstract syntax for variable binders: An overview. In J. Lloyd and et. al., editors. Computational Logic - CL 2000, number 1861 in LNAI, pages 239-253. Springer, 2000.
30. D. Miller. Bindings, mobility of bindings, and the ▽-quantifier. In J. Marcinkowski and A. Tarlecki, editors, 18th International Workshop CSL 2004, volume 3210 of LNCS, page 24, 2004.
31. D. Miller. Overview of linear logic programming. In T. Ehrhard, J.-Y. Girard, P. Ruet, and P. Scott, editors, Linear Logic, in Computer Science, volume 316 of London Mathematical Society Lecture Note, pages 119-150. Cambridge University Press, 2004.
32. D. Miller and G. Nadatlnir. A logic programming approach to manipulating formulas and programs. In S. Haridi, editor, IEEE Symposium on Logic Programming, pages 379-388, San Francisco, September 1987.
33. 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.
34. D. Miller and C. Palarnidessi. Foundational aspects of syntax. ACM Computing Surveys, 31, September 1999.
35. D. Miller and A. Tiu. A proof theory for generic judgments: An extended abstract. In 18th Symp. on Logic in Computer Science, pages 118-127, IEEE, June 2003.
36. D. Miller and A. Tiu. A proof theory for generic judgments. ACM Trans. on Computational Logic, 6(4);749-783, Oct. 2005.
37. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
38. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part 11. Information and Computation, pages 41-77, 1992.
39. A. Momigliano and A. Tiu. Induction and co-induction in sequent calculus. In M. C. Stefano Berardi and F. Damiani, editors, Post-proceedings of TYPES 2003, number 3085 in LNCS, pages 293 - 308, January 2003.
40. G. Nadathur and D. Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pages 810-827. Seattle, August 1988. MIT Press.
41. G. Nadathur and D. Miller. Higher-order Horn clauses. Journal of the ACM, 37(4) :777-814, October 1990.
42. G. Nadathur and D. J. Mitchell. System description: Teyjus - a compiler and abstract machine based implementation of Lambda Prolog. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, pages 287-291, Trento, Italy, July 1999. Springer-Verlag LNCS.
43. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, 2002. LNCS Tutorial 2283.
44. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of LNAI, pages 748-752, Saratoga, NY, jun 1992. Springer-Verlag.
45. L. Paulson. Compiler Generation from Denotational Semantics. In B. Lorho, editor, Methods and Tools for Compiler Construction, pages 219-250. Cambridge Univ. Press, 1984.
46. L. C. Paulson and K. Gra̧bczewski. Mechanizing set theory: Cardinal arithmetic and the axiom of choice. J. of Automated Deduction, 17(3):291-323, Dec. 1996.
47. F. Pfenning and C. 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.
48. F. Pfenning and C. Schürrnann. System description; Twelf - A meta-logical framework for deductive systems. In H. Ganzinger, editor, 16th Conference on Automated Deduction, number 1632 in LNAI, pages 202-206, Trento, 1999. Springer.
49. D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33(1):69-97, 1996.
50. P. 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.
51. C. Schürmann and F. Pfenning. A coverage checking algorithm for LF. In Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, volume 2758 of LNCS, pages 120-135. Springer-Verlag, 2003.
52. A. Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University, May 2004.
53. A. Tiu. Model checking for π-calculus using proof search. In M. Abadi and L. de Alfaro, editors, CONCUR, volume 3653 of LNCS, pages 36-50. Springer, 2005.
54. A. Tiu and D. Miller. A proof search specification of the π-calculus. In 3rd Workshop on the Foundations of Global Ubiquitous Computing, volume 138 of ENTCS, pages 79-101, Sept. 2004.
55. A. Tiu, G. Nadathur, and D. Miller. Mixing finite success and finite failure in an automated prover. In Proceedings of ESHOL '05: Empirically Successful Automated Reasoning in Higher-Order Logics, pages 79 - 98, December 2005.
56. A. Ziegler, D. Miller, and C. Palamidessi. A congruence format for name-passing calculi. In Proceedings of SOS 2005: Structural Operational Semantics, Electronic Notes in Theoretical Computer Science, Lisbon, Portugal, July 2005. Elsevier Science B.V.