Observational equality, now!

PLPV'07: Proceedings of the 2007 Workshop on Programming Languages meets Program Verification

Volumn , Issue , 2007, Pages 57-68

  Altenkirch, Thorsten ^a   McBride, Conor ^a   Swierstra, Wouter ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Equality; Type theory

Indexed keywords

DATA STRUCTURES; FUNCTION EVALUATION; STANDARDS;

OBSERVATIONAL EQUALITY; TYPE THEORY;

COMPUTER PROGRAMMING;

EID: 38849109953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1292597.1292608     Document Type: Conference Paper

References (29)

1. Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Containers constructing strictly positive types. Theoretical Computer Science, 342:3-27, September 2005.
2. Andreas Abel. A PolymorphiC Lamhda-Calcuius with Sized HigherOrder Types. PhD thesis, Ludwig-Maximilians-Universität München, 2006.
3. Andreas Abel, Thierry Coquand, and Peter Dybjer. Normalization by evaluation for Martin-Löf type theory with typed equality judgements. In Logic in Computer Science, 2007.
4. Thorsten Altenkirch. Extensional equality in intensional type theory. In LICS 99, 1999.
5. Lennart Augustsson. Cayenne - a language with, dependent types. In ICFP '98: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, pages 239-250, 1998.
6. Alexandre Buisse and Peter Dybjer. Formalizing categorical models of type theory in type theory. In International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2007.
7. Robert L. Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with, the Nuprl Development System. Prentice-Hall, 1986.
8. Thierry Coquand. Pattern matching with dependent types. In B. Nordström, K. Pettersson, and G. Plotkin, editors, Informal Proceedings Workshop on Types for Proofs and Programs, Båstad, Sweden, 8-12 June 1992, pages 71-84. Dept. of Computing Science, Chalmers Univ. of Technology and Göteborg Univ., 1992.
9. P. Dybjer and A. Setzer. A finite axiomatization of inductive-recursive definitions. Typed Lumbda Calculi and Applications, 1581:129-146, 1999.
10. Peter Dybjer. Inductive Sets and Families in Martin-Löf's Type Theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
11. Conor McBride et al. Epigram, 2004. http://www.e-pig.org.
12. Healfdene Goguen, Conor McBride, and James McKinna. Eliminating dependent pattern matching. In Kokichi Futatsugi, Jean-Pierre Jouannaud, and José Meseguer, editors, Essays Dedicated to Joseph A. Goguen, volume 4060 of Lecture Notes in Computer Science, pages 521-540. Springer, 2006.
13. Martin Hofmann. Conservativity of equality reflection over intensional type theory. In TYPES 95, pages 153-164, 1995.
14. Martin Hofmann. Extensional concepts in intensional type theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1995. Available from http://www.lfcs. informatics.ed.ac.uk/reports/ 95/ECS-LFCS-95-327/.
15. Martin Hofmann and Thomas Streicher. A groupoid model refutes uniqueness of identity proofs. In LICS 94, pages 208-212, 1994.
16. G. Huet and A. Saïbi. Constructive Category Theory. MIT Press, 1998.
17. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
18. Conor McBride. Dependency Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999. Available from http://www.lfcs.informatics.ed.ac.uk/reports/00/ ECS-LFCS-00-419/.
19. Conor McBride. Elimination with a Motive. In Paul Callaghan, Zhaohui Luo, James McKinna, and Robert Pollack, editors, Types for Proofs and Programs (Proceedings of the International Workshop, TYPES'00), volume 2277. Springer-Verlag, 2002.
20. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004.
21. Ulf Norell. Agda2. http://appserv.cs.chalmers.se/users/ ulfn/wiki/agda.php.
22. Nicolas Oury. Extensionality in the calculus of constructions. In TPHOL 05, pages 278-293, 2005.
23. ω's programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Prog ramming Languages, Austin, January 1989. ACM.
24. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Simple unification-based type inference for GADTs. In Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, 2006.
25. Tim Sheard. Putting Curry-Howard to work. In Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pages 74-85, 2005.
26. Martin Sulzmann, Manuel M. T. Chakravarty, Simon Peyton Jones, and Kevin Donnelly. System f with type equality coercions. In TLDI "07: Proceedings of the 2007ACM SIGPLAN international workshop on Types in languages design and implementation, pages 53-66, New York, NY, USA, 2007. ACM Press.
27. David A. Turner. A new formulation of constructive type theory. In Peter Dybjer et al.., editor, Proceedings of the Workshop on Programming Logic. Programming Methodology Group, University of Gothenburg and Chalmers University of Technology, 1989.
28. B. Werner. Une Théorie des Constructions Inductives. PhD thesis, Université Paris 7, 1994.
29. Hongwei Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998.