ATS: A language that combines programming with theorem proving

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

Volumn 3717 LNAI, Issue , 2005, Pages 310-320

  Cui, Sa ^a   Donnelly, Kevin ^a   Xi, Hongwei ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATS; CONSTRUCTING PROGRAMS; PROGRAMMING PARADIGM;

ENCODING (SYMBOLS); FORMAL LANGUAGES; FUNCTION EVALUATION; THEOREM PROVING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646170863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_19     Document Type: Conference Paper

References (16)

1. H. P. Barendregt. Lambda Calculi with Types. In S. Abramsky, D. M. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 117-441. Clarendon Press, Oxford, 1992.
2. Y. Bertot and P. Casteran. Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer Verlag, 2004.
3. C. Chen, R. Shi, and H. Xi. A Typeful Approach to Object-Oriented Programming with Multiple Inheritance. In Proceedings of the 6th International Symposium on Practical Aspects of Declarative Languages, Dallas, TX, June 2004. Springer-Verlag LNCS vol. 3057.
4. C. Chen and H. Xi. ATS/LF: a type system for constructing proofs as total functional programs, November 2004. http://wwv.cs.bu.edu/~hwxi/ATS/PAPER/ATSLF. ps
5. C. Chen and H. Xi. Combining Programming with Theorem Proving, November 2004. (http://www.cs.bu.edu/~hwjci/ATS/PAPER/CPwTP.ps)
6. R. L. Constable et al. Implementing Mathematics with the NuPrl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
7. R. L. Constable and S. F. Smith. Partial objects in constructive type theory. In Proceedings of Symposium on Logic in Computer Science, pages 183-193, Ithaca, New York, June 1987.
8. G. Dantzig and B. Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14:288-297, 1973.
9. S. Hayashi and H. Nakano. PX: A Computational Logic. The MIT Press, 1988.
10. F. Honsell, I. A. Mason, S. Smith, and C. Talcott. A variable typed logic of effects. Information and Computation, 119(1):55-90, 15 May 1995.
11. N. Mendier. Recursive types and type constraints in second-order lambda calculus. In Proceedings of Symposium on Logic in Computer Science, pages 30-36, Ithaca, New York, June 1987. The Computer Society of the IEEE.
12. R. Milner, M. Tofte, R. W. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, Massachusetts, 1997.
13. F. Pfenning and C. Elliott. Higher-order abstract syntax. In ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, volume 23 (7), pages 199-208, Atlanta, Georgia, July 1988. ACM Press.
14. H. Xi. Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003, pages 394-408. Springer-Verlag LNCS 3085, 2004.
15. H. Xi. Applied Type System, 2005. http://www.cs.bu.edu/~hwxi/ATS
16. D. Zhu and H. Xi. Safe Programming with Pointers through Stateful Views. In Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages, Long Beach, CA, January 2005. Springer-Verlag LNCS, 3350.