Constructing strictly positive families

Conferences in Research and Practice in Information Technology Series

Volumn 65, Issue , 2007, Pages

  Morris, Peter ^a   Altenkirch, Thorsten ^a   Ghani, Neil ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Advanced Data Types; Dependently Typed Programming; Epigram; Generic Programming

Indexed keywords

DATA TYPE; EPIGRAM; GENERIC PROGRAMMING; INDUCTIVE FAMILIES; INDUCTIVE-TYPE; META LANGUAGE; NORMAL FORM;

COMPUTATION THEORY;

EID: 84863567390     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Abbott, M., Altenkirch, T. & Ghani, N. (2005), 'Containers - constructing strictly positive types', Theoretical Computer Science 342, 3-27. Applied Semantics: Selected Topics.
2. Abbott, M., Altenkirch, T., Ghani, N. & McBride, C. (2005), '∂ for data', Fundamentae Informatica 65(1,2), 1 - 28. Special Issue on Typed Lambda Calculi and Applications 2003.
3. Altenkirch, T., Ghani, N., Hancock, P., McBride, C. & Morris, P. (2006), 'Indexed containers', Manuscript, available online.
4. Altenkirch, T. & McBride, C. (2006), 'Towards observational type theory', Manuscript, available online.
5. Altenkirch, T., McBride, C. & McKinna, J. (2005), 'Why dependent types matter', Manuscript, available online.
6. Benke, M., Dybjer, P. & Jansson, P. (2003), 'Universes for generic programs and proofs in dependent type theory', Nordic Journal of Computing 10, 265-269.
7. Dybjer, P. & Setzer, A. (2001), Indexed inductionrecursion., in R. Kahle, P. Schroeder-Heister & R. F. Stärk, eds, 'Proof Theory in Computer Science', Vol. 2183 of Lecture Notes in Computer Science, Springer, pp. 93-113.
8. Gambino, N. & Hyland, M. (2004), Wellfounded trees and dependent polynomial functors, in S. Berardi, M. Coppo & F. Damiani, eds, 'Types for Proofs and Programs (TYPES 2003)', LNCS.
9. Jay, C. B. (1995), 'A semantics for shape', Science of Computer Programming 25, 251-283.
10. Martin-Löf, P. (1984), Intuitionistic Type Theory, Bibliopolis·Napoli.
11. McBride, C. (2004), 'Epigram'. http://www.e-pig.org/.
12. McBride, C. & McKinna, J. (2004), 'The view from the left', Journal of Functional Programming 14(1).
13. Morris, P., Altenkirch, T. & McBride, C. (2006), Exploring the regular tree types, in C. P.-M. Jean-Christophe Filliatre & B. Werner, eds, 'Types for Proofs and Programs (TYPES 2004)', Lecture Notes in Computer Science.
14. Nordström, B., Petersson, K. & Smith, J. (1990), Programming in Martin-Löf's Type Theory: an introduction, Oxford University Press.