Implementing cut elimination: A case study of simulating dependent types in Haskell

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

Volumn 3057, Issue , 2004, Pages 239-254

  Chen, Chiyan ^a   Zhu, Dengping ^a   Xi, Hongwei ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS);

CLASSICAL LOGIC; CUT-ELIMINATION THEOREM; FUNDAMENTAL PROPERTIES; INTUITIONISTIC LOGIC; INTUITIONISTIC SEQUENT CALCULUS; PROBLEMATIC ISSUES; SEQUENT CALCULUS; SIMULATION TECHNIQUE;

CALCULATIONS;

EID: 84974736268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24836-1_17     Document Type: Conference Paper

References (19)

1. Baars, A. I., and Swierstra, S. D. Typing Dynamic Typing. In Proceedings of the 7th ACM SIGPLAN International Conference on Functional Programming (ICFP ’02) (Pittsburgh, PA, October 2002).
2. Chen, C., and Xi, H. Implementing Typeful Program Transformations. In Proceedings of ACM SIGPLAN Workshop on Partial Evaluation and Semantics Based Program Manipulation (San Diego, CA, June 2003), pp. 20-28.
3. Chen, C., Zhu, D., and Xi, H. Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell, October 2003. Available at: http://www.cs.bu.edu/˜hwxi/academic/papers/CutElim.
4. Cheney, J., and Hinze, R. A Lightweight Implementation of Generics and Dynamics. In Proceedings of Haskell Workshop (Pittsburgh, PA, October 2002), ACM Press, pp. 90-104.
5. Cheney, J., and Hinze, R. Phantom Types. Technical Report CUCIS-TR2003-1901, Cornell University, 2003. Available as http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/ cul.cis/TR2003-1901.
6. Fridlender, D., and Indrika, M. Do we need dependent types? Functional Pearl in the Journal of Functional Programming 10, 4 (July 2000), 409-415.
7. Gentzen, G. Untersuchungen über das logische Schlieβen. Mathematische Zeitschrift 39 (1935), 176-210, 405-431.
8. Hall, C. V., Hammond, K., Jones, S. L. P., and Wadler, P. L. Type Classes in Haskell. ACM Transactions on Programming Languages and Systems 18, 2 (March 1996), 109-138.
9. Harper, R. W., Honsell, F., and Plotkin, G. D. A framework for defining logics. Journal of the ACM 40, 1 (January 1993), 143-184.
10. Hinze, R. Manufacturing Datatypes. Journal of Functional Programming 11, 5 (September 2001), 493-524. Also available as Technical Report IAI-TR-99-5, Institut für Informatik III, Universität Bonn.
11. Jones, M. P. Type Classes with Functional Dependencies. In Proceedings of the 9th European Symposium on Programming (Berlin, Germany, 1999), vol. 1782 of Lecture Notes in Computer Science, Springer-Verlag, pp. 230-244.
12. McBride, C. Faking It. Journal of Functional Programming 12, 4 & 5 (July 2002), 375-392.
13. Milner, R. A theory of type polymorphism in programming. Journal of Computer and System Sciences 17, 3 (December 1978), 348-375.
14. Okasaki, C. From Fast Exponentiation to Square Matrices: An Adventure in Types. In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming (September 1999).
15. Pfenning, F. Computation and Deduction. Cambridge University Press. (to appear).
16. Pfenning, F. Logic programming in the LF logical framework. In Logical Frameworks, I. G. Huet and G. Plotkin, Eds. Cambridge University Press, 1991, pp. 149-181.
17. Pfenning, F. Structural Cut Elimination. In Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science (San Diego, CA, June 1995), pp. 156-166.
18. Pfenning, F. Structural Cut Elimination I: intuitionistic and classical logic. Information and Computation 157, 1/2 (March 2000), 84-141.
19. Xi, H., Chen, C., and Chen, G. Guarded Recursive Datatype Constructors. In Proceedings of the 30th ACM SIGPLAN Symposium on Principles of Programming Languages (New Orleans, LA, January 2003), pp. 224-235.