Towards generic programming with sized types

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

Volumn 4014 LNCS, Issue , 2006, Pages 10-28

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; PROGRAMMING THEORY; RECURSIVE FUNCTIONS;

GENERIC PROGRAMMING; INSTANTIATION TYPE; POLYTYPIC PROGRAMMING; RECURSION SCHEME;

LOGIC PROGRAMMING;

EID: 33746062848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11783596_4     Document Type: Conference Paper

References (48)

1. Abel, A.: Termination and guardedness checking with continuous types. In Hofmann, M., ed.: Proc. of 6th Int. Conf. on Typed Lambda Calculi and Applications, TLCA 2003. Vol. 2701 of Lect. Notes in Comput. Sci. Springer-Verlag (2003) 1-15
2. Abel, A.: Termination checking with types. Theor. Inform. and Appl. 38 (2004) 277-319.
3. Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians-Universität München (2006) Draft available at http://www.tcs.ifi.lmu.de/~abel/diss.pdf
4. Abel, A., Matthes, R., Uustalu, T.: Iteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. 333 (2005) 3-66
5. Altenkirch, T., McBride, C.: Generic programming within dependently typed programming, In Gibbons, J., Jeuring, J., eds.: Proc. of IFIP TC2/WG2.1 Working Conf. on Generic Programming, WCGP '02. Vol. 243 of IFIP Conf. Proceedings. Kluwer (2003) 1-20
6. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In Flum, J., Rodríguez-Artalejo, M., eds.: Proc. of 13th Int. Wksh. on Computer Science Logic, CSL '99. Vol. 1683 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 453-468
7. Backhouse, R., Jansson, P., Jeuring, J., Meertens, L.: Generic programming - an introduction. In Swierstra, S.D., Henriques, P.R., Oliveira, J.N.: Revised Lectures from 3rd Int. School on Advanced Functional Programming, AFP '98. Vol. 1608 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 28-115
8. Barthe, G., Frade, M. J., Giménez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Math. Struct. in Comput. Sci. 14 (2004) 1-45
9. Barthe, G., Grégoire, B., Pastawski, F.: Practical inference for type-based termination in a polymorphic setting. In Urzyczyn, P., ed.: Proc. of 7th Int. Conf. on Typed Lambda Calculi and Applications, TLCA 2005. Vol. 3461 of Lect. Notes in Comput. Sci. Springer-Verlag (2005) 71-85
10. Benke, M., Dybjer, P., Jansson, P.: Universes for generic programs and proofs in dependent type theory. Nord. J. of Comput. 10 (2003) 265-289
11. Bird, R., Meertens, L.: Nested datatypes, In: Jeuring, J., ed., Proc. of 4th Int. Conf. on Mathematics of Program Construction, MPC '98. Vol. 1422 of Lect. Notes in Comput. Sci. Springer-Verlag (1998) 52-67
12. Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Asp. Comput. 11 (1999) 200-222
13. Bird, R. S., Paterson, R.: De Bruijn notation as a nested datatype. J. Funct. Program. 9 (1999) 77-91
14. Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In van Oostrom, V., ed.: Rewriting Techniques and Applications, RTA 2004. Vol. 3091 of Lect. Notes in Comput. Sci. Springer-Verlag (2004) 24-39
15. Blanqui, F.: Decidability of type-checking in the Calculus of Algebraic Constructions with size annotations. In Ong, C.-H. L., ed.: Proc. of 19th Int. Wksh. on Computer Science Logic, CSL 2005. Vol. 3634 of Lect. Notes in Comput. Sci. Springer-Verlag (2005) 135-150
16. Crary, K., Weirich, S.: Flexible type analysis. In Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'99, ACM Press (1999) 233-248
17. Crary, K., Weirich, S., Morrisett, J. G.: Intensional polymorphism in type-erasure semantics. In Proc. of 3rd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '98. ACM Press (1998) 301-312
18. Frade, M. J.: Type-Based Termination of Recursive Definitions and Constructor Subtyping in Typed Lambda Calculi. PhD thesis, Dep. de Informática, Universidade do Minho (2003)
19. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In van Oostrom, V., ed.: Proc. of 15th Int. Conf. on Rewriting Techniques and Applications, RTA 2004. Vol. 3091 of Lect. Notes in Comput. Sci. Springer-Verlag (2004) 210-220
20. Giménez, E.: Structural recursive definitions in type theory. In Larsen, K.G., Skyum, S., Winskel, G., eds.: Proc. of 25th Int. Coll. on Automata, Languages and Programming, ICALP '98, Vol. 1443 of Lect. Notes in Comput. Sci. Springer-Verlag (1998) 397-408
21. Harper, R., Morrisett, J. G.: Compiling polymorphism using intensional type analysis, In Conf. Record of 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'95, ACM Press (1995) 130-141
22. Hinze, R.: Numerical representations as higher-order nested datatypes, Technical Report IAI-TR-98-12, Institut für Informatik III, Universität Bonn (1998)
23. Hinze, R.: Polytypic programming with ease (extended abstract). In: Middeldorp, A., Sato, T., eds.: Proc. of 4th Fuji Int. Symp. on Functional and Logic Programming, FLOPS '99. Vol. 1722 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 21-36
24. Hinze, R.: Generalizing generalized tries. J. of Funct. Program. 10 (2000) 327-351
25. Hinze, R.: A new approach to generic functional programming. In Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2000, ACM Press (2000) 119-132
26. Hinze, R.: Manufacturing datatypes. J. of Funct. Program. 11 (2001) 493-524
27. Hinze, R.: Polytypic values possess polykinded types. Sci. of Comput. Program. 43 (2002) 129-159
28. Hinze, R., Jeuring, J.: Generic Haskell: Applications. In Backhouse, R. C., Gibbons, J., eds.: Generic Programming - Advanced Lectures. Vol. 2793 of Lect. Notes in Comput. Sci. Springer-Verlag (2003) 57-96
29. Hinze, R., Jeuring, J.: Generic Haskell: Practice and Theory. In Backhouse, R. C., Gibbons, J., eds.: Generic Programming - Advanced Lectures. Vol. 2793 of Lect. Notes in Comput. Sci. Springer-Verlag (2003) 1-50
30. Hinze, R., Jeuring, J., Löh, A.: Type-indexed data types. Sci. of Comput. Program. 51 (2004) 117-151
31. Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In Conf. Record of 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '96. ACM Press (1996) 410-423
32. INRIA: The Coq Proof Assistant Reference Manual, version 8.0 edition (2004) http://coq.inria.fr/doc/main.html
33. Jansson, P.: Functional Polytypic Programming, PhD thesis, Dept. of Computing Science, Chalmers University of Technology (2000)
34. Jansson, P., Jeuring, J.: PolyP - a polytypic programming extension. In Conf. Record of 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '97. ACM Press (1997) 470-482
35. Janssou, P., Jeuring, J.: Polytypic data conversion programs. Sci. of Comput. Program. 43 (2002) 35-75
36. Martin, C., Gibbons, J., Bayley, I.: Disciplined, efficient, generalised folds for nested datatypes. Formal Asp. of Comput. 16 (2004) 19-35
37. Mendler, N. P.: Recursive types and type constraints in second-order lambda calculus. In Proc. of 2nd Ann IEEE Symp. on Logic in Computer Science, LICS '87. IEEE Computer Soc. Press (1987) 30-36
38. Norell, U.: Functional Generic Programming and Type Theory. Master's thesis, Computing Science, Chalmers University of Technology (2002). Available from http://www.cs.chalmers.se/~ulfn
39. Norell, U., Jansson, P.: Polytypic programming in Haskell. In Trinder, P.W., Michaelson, G., Pena, R., eds.: Revised Papers from 15th Int. Wksh. on Implementation of Functional Languages, IFL 2003. Lect. Notes in Comput. Sci. Springer-Verlag (2004) 168-184
40. Norell, U., Jansson, P.: Prototyping generic programming in Template Haskell. In: Kozen, D., Shankland, C., ed., Proc. of 7th Int. Conf. on Mathematics of Program Construction, MPC '04. Vol. 3125 of Lect. Notes in Comput. Sci. Springer-Verlag (2004) 314-333
41. Okasaki, C.: Purely Functional Data Structures. Ph.D. thesis, Carnegie Mellon University (1996)
42. Okasaki, C.: From fast exponentiation to square matrices: An adventure in types. In Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '99. ACM Press (1999) 28-35
43. Okasaki, C.: Red-black trees in a functional setting. J. of Funct. Program. 9 (1999) 471-477
44. Pareto, L.: Types for Crash Prevention. PhD thesis, Dept. of Computing Science, Chalmers University of Technology (2000)
45. Pfeifer, H., Rueß, H.: Polytypic proof construction. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L., eds., Theorem Proving in Higher Order Logics, TPHOLs '99. Vol. 1690 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 55-72
46. Pierce, B. C.: Types and Programming Languages. MIT Press (2002)
47. Saha, B., Trifonov, V., Shao, Z.: Intensional analysis of quantified types. ACM Trans. on Program. Lang, and Syst. 25 (2003) 159-209
48. Sereni, D., Jones, N. D.: Termination analysis of higher-order functional programs. In Yi, K., ed.: Proc. of 3rd Asian Symp. on Programming Languages and Systems, APLAS 2005. Vol. 3780 of Lect. Notes in Comput. Sci. Springer-Verlag (2005) 281-297