Type-based termination of generic programs

Science of Computer Programming

Volumn 74, Issue 8, 2009, Pages 550-567

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Functional programming; Polytypic programming; Recursion; Sized type; Type indexed type

Indexed keywords

INSTANTIATION TYPES; POLYTYPIC PROGRAMMING; RECURSION; RECURSION SCHEMES; RECURSIVE TYPES; SIZED TYPE; TYPE-INDEXED TYPE;

FUNCTIONAL PROGRAMMING;

EID: 67349228415     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2008.01.004     Document Type: Article

References (36)

1. A. Abel, A polymorphic lambda-calculus with sized higher-order types, Ph.D. Thesis, Ludwig-Maximilians-Universität München, 2006
2. Abel A. Semi-continuous sized types and termination. In: Ésik Z. (Ed). Proc. of 20th Int. Wksh. on Computer Science Logic. CSL 2006, Szeged, Sept. 2006. Lect. Notes in Comput. Sci vol. 4207 (2006), Springer, Berlin 72-88
3. Abel A. Towards generic programming with sized types. In: Uustalu T. (Ed). Proc. of 8th Int. Conf. on Mathematics of Program Construction. MPC 2006, Kuressaare, July 2006. Lect. Notes in Comput. Sci vol. 4014 (2006), Springer, Berlin 10-28
4. Abel A., Matthes R., and Uustalu T. Iteration schemes for higher-order and nested datatypes. Theoret. Comput. Sci. 333 1-2 (2005) 3-66
5. Altenkirch T., and McBride C. Generic programming within dependently typed programming. In: Gibbons J., and Jeuring J. (Eds). Proc. of TC2/WG2.1 Working Conf. on Generic Programming. WCGP 2002, Dagstuhl, July 2002. IFIP Conf. Proc. vol. 243 (2003), Kluwer, Dordrecht 1-20
6. Altenkirch T., and Reus B. Monadic presentations of lambda terms using generalized inductive types. In: Flum J., and Rodríguez-Artalejo M. (Eds). Proc. of 13th Int. Wksh. on Computer Science Logic. CSL '99, Madrid, Sept. 1999. Lect. Notes in Comput. Sci. vol. 1683 (1999), Springer, Berlin 453-468
7. Backhouse R., Jansson P., Jeuring J., and Meertens L. Generic programming: an introduction. In: Swierstra S.D., Henriques P.R., and Oliveira J.N. (Eds). Revised Lectures from 3rd Int. Summer School on Advanced Functional Programming. AFP '98, Braga, Sept. 1998. Lect. Notes in Comput. Sci. vol. 1608 (1999), Springer, Berlin 28-115
8. Barthe G., Frade M.J., Giménez E., Pinto L., and Uustalu T. Type-based termination of recursive definitions. Math. Struct. Comput. Sci. 14 1 (2004) 1-45
9. Barthe G., Grégoire B., and 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, Nara, Apr. 2005. Lect. Notes in Comput. Sci. vol. 3461 (2005), Springer, Berlin 71-85
10. Benke M., Dybjer P., and Jansson P. Universes for generic programs and proofs in dependent type theory. Nord. J. Comput. 10 4 (2003) 265-289
11. Bird R., and Meertens L. Nested datatypes. In: Jeuring J. (Ed). Proc. of 4th Int. Conf. on Mathematics of Program Construction. MPC '98, Marstrand, June 1998. Lect. Notes in Comput. Sci. vol. 1422 (1998), Springer, Berlin 52-67
12. 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, Oxford, Aug. 2005. Lect. Notes in Comput. Sci. vol. 3634 (2005), Springer, Berlin 135-150
13. Crary K., and Weirich S. Flexible type analysis. Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming. ICFP '99, Paris, Sept. 1999 (1999), ACM Press, New York 233-248 (= ACM SIGPLAN Notices 34(9))
14. Crary K., Weirich S., and Morrisett G. Intensional polymorphism in type-erasure semantics. Proc. of 3rd ACM SIGPLAN Int. Conf. on Functional Programming. ICFP '98, Baltimore, MD, Sept. 1998 (1998), ACM Press, New York 301-312 (= ACM SIGPLAN Notices 34(1))
15. Giesl J., Thiemann R., Schneider-Kamp P., and Falke S. Automated termination proofs with AProVE. In: van Oostrom V. (Ed). Proc. of 15th Int. Conf. on Rewriting Techniques and Applications. RTA 2004, Aachen, June 2004. Lect. Notes in Comput. Sci. vol.3091 (2004), Springer, Berlin 210-220
16. Giménez E. Structural recursive definitions in type theory. In: Larsen K.G., Skyum S., and Winskel G. (Eds). Proc. of 25th Int. Coll. on Automata, Languages and Programming. ICALP '98, Aalborg, July 1998. Lect. Notes in Comput. Sci. vol. 1443 (1998), Springer, Berlin 397-408
17. Harper R., and Morrisett G. Compiling polymorphism using intensional type analysis. Conf. Record of 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL '95, San Francisco, CA, Jan. 1995 (1995), ACM Press, New York 130-141
18. Hinze R. Generalizing generalized tries. J. Funct. Programming 10 4 (2000) 327-351
19. Hinze R. A new approach to generic functional programming. Proc. of 27th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL 2000, Boston, MA, Jan. 2000 (2000), ACM Press, New York 119-132
20. Hinze R. Polytypic values possess polykinded types. Sci. Comput. Programming 43 2-3 (2002) 129-159
21. Hinze R., and Jeuring J. Generic Haskell: Applications. In: Backhouse R., and Gibbons J. (Eds). Generic Programming: Advanced Lectures. Lect. Notes in Comput. Sci. vol. 2793 (2003), Springer, Berlin 57-97
22. Hinze R., and Jeuring J. Generic Haskell: Practice and theory. In: Backhouse R., and Gibbons J. (Eds). Generic Programming: Advanced Lectures. Lect. Notes in Comput. Sci. vol. 2793 (2003), Springer, Berlin 1-56
23. Hinze R., Jeuring J., and Löh A. Type-indexed data types. Sci. Comput. Programming 51 1-2 (2004) 117-151
24. Hughes J., Pareto L., and Sabry A. Proving the correctness of reactive systems using sized types. Conf. Record of 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL '96, St. Petersburg Beach, FL, Jan. 1996 (1996), ACM Press, New York 410-423
25. INRIA, The coq proof assistant, Version 8.1, 2007 http://coq.inria.fr/
26. Jansson P., and Jeuring J. PolyP-a polytypic programming language extension. Conf. Record of 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL '97, Paris, Jan. 1997 (1997), ACM Press, New York 470-482
27. Mendler N.~P. Recursive types and type constraints in second-order lambda calculus. Proc. of 2nd Ann. IEEE Symp. on Logic in Computer Science. LICS '87, Ithaca, NY, June 1987 (1987), IEEE CS Press, Washington, DC 30-36
28. U. Norell, Functional generic programming and type theory, Master's Thesis, Dept. of Computing Science, Chalmers University of Technology, 2002, Available online at http://www.cs.chalmers.se/~ulfn/
29. Norell U., and Jansson P. Polytypic programming in Haskell. In: Trinder P., Michaelson G., and Peña R. (Eds). Revised Papers from 15th Int. Wksh. on Implementation of Functional Languages. IFL 2003, Edinburgh, Sept. 2003. Lect. Notes in Comput. Sci. vol. 3145 (2004), Springer, Berlin 168-184
30. Norell U., and Jansson P. Prototyping generic programming in Template Haskell. In: Kozen D., and Shankland C. (Eds). Proc. of 7th Int. Conf. on Mathematics of Program Construction. MPC 2004, Stirling, July 2004. Lect. Notes in Comput. Sci. vol. 3125 (2004), Springer, Berlin 314-333
31. Okasaki C. From fast exponentiation to square matrices: An adventure in types. Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming. ICFP '99, Paris, Sept. 1999 (1999), ACM Press, New York 28-35 (= ACM SIGPLAN Notices 34(9))
32. L. Pareto, Types for crash prevention, Ph.D. Thesis, Chalmers University of Technology, 2000
33. Pfeifer H., and Rueß H. Polytypic proof construction. In: Bertot Y., Dowek G., Hirschowitz A., Paulin C., and Théry L. (Eds). Proc. of 12th Int. Conf. on Theorem Proving in Higher Order Logics. TPHOLs '99, Nice, Sept. 1999. Lect. Notes in Comput. Sci. vol. 1690 (1999), Springer, Berlin 55-72
34. Pierce B.C. Types and Programming Languages (2002), MIT Press, Cambridge, MA
35. Saha B., Trifonov V., and Shao Z. Intensional analysis of quantified types. ACM Trans. Program. Lang. Syst. 25 2 (2003) 159-209
36. Sereni D., and 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, Tsukuba, Nov. 2005. Lect. Notes in Comput. Sci. vol. 3780 (2005), Springer, Berlin 281-297