Erasure and polymorphism in pure type systems

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

Volumn 4962 LNCS, Issue , 2008, Pages 350-364

  Mishra Linger, Nathan ^a   Sheard, Tim ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DUPLICATION; COMPILE TIME; COMPUTATIONAL STRUCTURES; EUROPEAN; EXECUTION MODELS; HEIDELBERG (CO); INTERNATIONAL (CO); INTRINSIC PROPERTIES; LANGUAGES (TRADITIONAL); PARAMETRIC POLYMORPHISMS; PROGRAM ANNOTATIONS; PURE TYPE SYSTEMS; RUN TIME; SOFTWARE SCIENCE; TYPING RULES;

COMPUTATIONAL LINGUISTICS; FOUNDATIONS; INFORMATION THEORY; POLYMORPHISM;

CODES (SYMBOLS);

EID: 47249102619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_25     Document Type: Conference Paper

References (22)

1. The Coq proof assistant, http://coq.inria.fr
2. Abadi, M., Cardelli, L., Curien, P.-L.: Formal parametric polymorphism. Theoretical Computer Science 121(1-2), 9-58 (1993)
3. Augustsson, L.: Cayenne - A language with dependent types. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, pp. 239-250 (1998)
4. Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, Oxford University Press, Oxford (1992)
5. Blazy, S., Dargaye, Z., Leroy, X.: Formal verification of a C compiler front-end. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 460-475. Springer, Heidelberg (2006)
6. Brady, E.: Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham (2005)
7. Chen, C., Xi, H.: Combining programming with theorem proving. In: Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming, pp. 66-77 (2005)
8. Leroy, X.: Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In: Proceedings of the 33rd ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 42-54 (2006)
9. Lin, C., McCreight, A., Shao, Z., Chen, Y., Guo, Y.: Foundational typed assembly language with certified garbage collection. In: First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, pp. 326-338. IEEE Computer Society Press, Los Alamitos (2007)
10. Luo, Z.: Computation and reasoning: A type theory for computer science. Oxford University Press, New York, USA (1994)
11. Mairson, H.G.: Outline of a proof theory of parametricity. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 313-327. Springer, Heidelberg (1991)
12. McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming 14(1), 69-111 (2004)
13. Miquel, A.: The implicit calculus of constructions. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 344-359. Springer, Heidelberg (2001)
14. Miquel, A.: Le Calcul des Constructions Implicite: Syntaxe et Sémantique. PhD thesis, Université Paris 7 (2001)
15. Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 106-119 (1997)
16. Peyton-Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unificationbased type inference for GADTs. In: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming (2006)
17. Pfenning, F.: Intensionality, extensionality, and proof irrelevance in modal type theory. In: LICS 2001: Proceedings of the 16th Annual Symposium on Logic in Computer Science, pp. 221-230. IEEE Computer Society Press, Los Alamitos (2001)
18. Plotkin, G.D., Abadi, M.: A logic for parametric polymorphism. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 361-375. Springer, Heidelberg (1993)
19. Sheard, T.: Languages of the future. In: Proceedings of the Nineteenth ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA Companion Volume, pp. 116-119 (2004)
20. Sheard, T., Pašalić, E.: Meta-programming with built-in type equality. In: Proceedings of the Fourth International Workshop on Logical Frameworks and MetaLanguages (LFM 2004), pp. 106-124 (2004), http://cs-www.cs.yale.edu/homes/carsten/lfm04/
21. Wadler, P.: Theorems for free! In: Functional Programming Languages and Computer Architecture, pp. 347-359. ACM Press, New York (1989)
22. Xi, H., Pfenning, F.: Dependent types in practical programming. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 214-227 (1999)