Combining higher-order abstract syntax with first-order abstract syntax in ATS

MERLIN'05 - Proceedings of the Third ACM SIGPLAN Workshop in Mechanized Reasoning about Languages with varIable biNding

Volumn , Issue , 2005, Pages 58-63

  Donnelly, Kevin ^a   Xi, Hongwei ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

ATS; ATS LF; Dependent Types; Higher Order Abstract Syntax; Theorem Proving

Indexed keywords

ATS; ATS/LF; HIGHER ORDER ABSTRACT INDEX;

ABSTRACTING; METADATA; OBJECT ORIENTED PROGRAMMING; SIGNAL ENCODING; THEOREM PROVING;

SYNTACTICS;

EID: 32044469812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088454.1088462     Document Type: Conference Paper

References (29)

1. AMBLER, S.J., CROLE, R. L., AND MOMIGLIANO, A. Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction. In Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, Hampton, VA, USA (2002), vol. 2410 of Lecture Notes in Computer Science, Springer-Verlag, pp. 13-30.
2. AMBLER, S. J., CROLE, R. L., AND MOMIGLIANO, A. A definitional approach to primitive recursion over higher order abstract syntax. In MERLIN '03: Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding (New York, NY, USA, 2003), ACM Press, pp. 1-11.
3. BARENDREGT, H. P. Lambda Calculi with Types. In Handbook of Logic in Computer Science, S. Abramsky, D. M. Gabbay, and T. Maibaum, Eds., vol. II. Clarendon Press, Oxford, 1992, pp. 117-441.
4. BIRD, R. S., AND PATERSON, R. de bruijn notation as a nested datatype. J. Funct. Program. 9, I (1999), 77-91.
5. CHEN, C., AND XI, H. Combining programming with theorem proving. In Proceedings of the 10th International Conference on Functional Programming (ICFP'05) (September 2005).
6. CHURCH, A. The Calculi of Lambda-Conversion, vol. 6 of Annals of Mathematics Studies. Princeton University Press, Princeton, 1941.
7. CONSTABLE, R. L., AND SMITH, S. F. Partial objects in constructive type theory. In Proceedings of Symposium on Logic in Computer Science (Ithaca, New York, June 1987), pp. 183-193.
8. DESPEYROUX, J., FELTY, A. P., AND HIRSCHOWITZ, A. Higher-order abstract syntax in coq. In TLCA (1995), pp. 124-138.
9. DESPEYROUX, J., AND HIRSCHOWITZ, A. Higher-order abstract syntax with induction in coq. In LPAR '94: Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning (London, UK, 1994), Springer-Verlag, pp. 159-173.
10. GABBAY, M. J., AND PITTS, A. M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001), 341-363. Special issue in honor of Rod Burstall. To appear.
11. HAYASHI, S., AND NAKANO, H. PX: A Computational Logic. The MIT Press, 1988.
12. HOFMANN, M. Semantical analysis of higher-order abstract syntax. In LICS '99: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (Washington, DC, USA, 1999). IEEE Computer Society, p. 204.
13. HONSELL, F., MASON, I. A., SMITH, S., AND TALCOTT, C. A variable typed logic of effects. Information and Computation 119, 1 (15 May 1995), 55-90.
14. MCDOWELL, R., AND MILLER, D. A logic for reasoning with higher-order abstract syntax. In LICS (1997), pp. 434-445.
15. MENDLER, N. Recursive types and type constraints in second-order lambda calculus. In Proceedings of Symposium on Logic in Computer Science (Ithaca, New York, June 1987), The Computer Society of the IEEE, pp. 30-36.
16. MILLER, D., AND TIU, A. A proof theory for generic judgments: An extended abstract. In Proceedings of LICS 2003 (June 2003), IEEE, pp. 118-127.
17. NANEVSKI, A. Meta-programming with names and necessity. In ICFP '02: Proceedings of the seventh ACM SIGPLAN international conference an Functional programming (New York, NY, USA, 2002), ACM Press, pp. 206-217.
18. PFENNING, F. Computation and Deduction. Cambridge University Press, (to appear).
19. PFENNING, F., AND ELLIOTT, C. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN '88 Symposium on Language Design and Implementation (Atlanta, Georgia, June 1988), pp. 199-208.
20. PITTS, A. M., AND GABBAY, M. J. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction. 5th International Conference, MPC2000. Ponte de Lima, Portugal, July 2000. Proceedings (2000), R. Backhouse and J. N. Oliveira, Eds., vol. 1837 of Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, pp. 230-255.
21. SCHÜRMANN, C., DESPEYROUX, J., AND PFENNING, F. Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci. 266, 1-2 (2001), 1-57.
22. SCHÜRMANN, C., POSWOLSKY, A., AND SARNAT, J. The [triangle]-calculus. functional programming with higher-order encodings. In TLCA (2005), P. Urzyczyn, Ed., vol. 3461 of Lecture Notes in Computer Science, Springer, pp. 339-353.
23. XI, H. Dependent Types in Practical Programming. PhD thesis, Camegie Mellon University, 1998. pp. viii+189. Available at http://www.cs.emu.edu/~hwxi/ DML/thesis.ps.
24. XI, H. Dependent Types for Program Terminalion Verification. In Proceedings of 16th IEEE Symposium on Logic in Computer Science (Boston, June 2001), pp. 231-242.
25. XI, H. Dependent Types for Program Termination Verification. Journal of Higher-Order and Symbolic Computation 15, 1 (March 2002), 91-132.
26. XI, H. Dependently Typed Pattern Matching. Journal of Universal Computer Science 9, 8 (2003), 851-872.
27. XI, H. Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003 (2004), Springer-Verlag LNCS 3085, pp. 394-408.
28. XI, H. Applied Type System, 2005. Available at: http://www.cs.bu.edu/ ~hwxi/ATS.
29. XI, H., AND PFENNING, F. Dependent Types in Practical Programming. In Proceedings of 26th ACM SIGPLAN Symposium on Principles of Programming Languages (San Antonio, Texas, January 1999), ACM press, pp. 214-227.