When is a type refinement an inductive type?

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

Volumn 6604 LNCS, Issue , 2011, Pages 72-87

  Atkey, Robert ^a   Johann, Patricia ^a   Ghani, Neil ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TYPE; INDUCTIVE-TYPE; PROGRAMMING LANGUAGE; REDUNDANT INFORMATIONS; TYPE SYSTEMS;

REFINING;

EID: 79953218392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19805-2_6     Document Type: Conference Paper

References (27)

1. Abbott, M., Altenkirch, T., Ghani, N.: Containers - constructing strictly positive types. Theoretical Computer Science 342, 3-27 (2005)
2. Altenkirch, T., McBride, C., Morris, P.: Generic Programming with Dependent Types. In: Backhouse, R., Gibbons, J., Hinze, R., Jeuring, J. (eds.) SSDGP 2006. LNCS, vol. 4719, pp. 209-257. Springer, Heidelberg (2007)
3. Backhouse, R., Gibbons, J., Hinze, R., Jeuring, J. (eds.): SSDGP 2006. LNCS, vol. 4719. Springer, Heidelberg (2007)
4. Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Heidelberg (1983)
5. Benke, M., Dybjer, P., Jansson, P.: Universes for generic programs and proofs in dependent type theory. Nordic Journal of Computing 10(4), 265-289 (2003)
6. Bird, R.S., de Moor, O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1997)
7. Brady, E., McBride, C., McKinna, J.: Inductive Families Need Not Store Their Indices. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 115-129. Springer, Heidelberg (2004)
8. Carboni, A., Lack, S., Walters, R.F.C.: Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra 84, 145-158 (1993)
9. Chapman, J., Dagand, P.-E., McBride, C., Morris, P.: The gentle art of levitation. In: Proc. ICFP, pp. 3-14 (2010)
10. Chuang, T.-R., Lin, J.-L.: An algebra of dependent data types. Technical Report TR-IIS-06-012, Institute of Information Science, Academia Sinica, Taiwan (2006)
11. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
12. Davies, R.: Practical Refinement-Type Checking. PhD thesis, Carnegie Mellon University, available as Technical Report CMU-CS-05-110 (2005)
13. Denney, E.: Refinement types for specification. In: Proc. PROCOMET, pp. 148-166. Chapman and Hall, Boca Raton (1998)
14. Dunfield, J.: A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, available as Technical Report CMU-CS-07-129 (2007)
15. Freeman, T., Pfenning, F.: Refinement types for ML. In: Proc. Symposium on Programming Language Design and Implementation, pp. 268-277 (June 1991)
16. Ghani, N., Johann, P., Fumex, C.: Fibrational Induction Rules for Initial Algebras. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 336-350. Springer, Heidelberg (2010)
17. Gordon, A.D., Fournet, C.: Principles and applications of refinement types. Technical Report MSR-TR-2009-147, Microsoft Research (October 2009)
18. Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Information and Computation 145(2), 107-152 (1998)
19. Jacobs, B.: Comprehension categories and the semantics of type dependency. Theoretical Computer Science 107, 169-207 (1993)
20. Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol. 141. North Holland, Amsterdam (1999)
21. Kawaguchi, M., Rondon, P.M., Jhala, R.: Type-based data structure verification. In: PLDI, pp. 304-315 (2009)
22. Lovas, W., Pfenning, F.: Refinement types for logical frameworks and their interpretation as proof irrelevance. Log. Meth, in Comp. Sci. (2010) (to appear)
23. McBride, C.: Ornamental algebras, algebraic ornaments (2010) (unpublished note)
24. Pfenning, F.: Refinement types for logical frameworks. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 285-299. Springer, Heidelberg (1994)
25. Rushby, J., Owre, S., Shankar, N.: Subtypes for specifications: Predicate subtyping in pvs. IEEE Transactions on Software Engineering 24(9), 709-720 (1998)
26. The Agda Team (2010), http://wiki.portal.chalmers.se/agda
27. Xi, H.: Dependently typed data structures. Revision after WAAAPL 1999 (2000)