Unfolding abstract datatypes

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

Volumn 5133 LNCS, Issue , 2008, Pages 110-133

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATATYPES; APPROPRIATE TECHNIQUES; CORECURSIVE PROGRAMS; INTERNATIONAL CONFERENCES; PROGRAM CONSTRUCTION; PROOF METHODS; UNIVERSAL PROPERTIES;

ABSTRACTING; MATHEMATICAL TECHNIQUES; MODEL PREDICTIVE CONTROL; PREDICTIVE CONTROL SYSTEMS; SOLUTIONS;

MATHEMATICAL OPERATORS;

EID: 48949097151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70594-9_8     Document Type: Conference Paper

References (62)

1. Bird, R.: Unfolding pointer algorithms. Journal of Functional Programming 11(3), 347-358 (2001)
2. Bird, R.S.: Introduction to Functional Programming Using Haskell. Prentice-Hall, Englewood Cliffs (1998)
3. Böhm, C., Berarducci, A.: Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science 39, 135-154 (1985)
4. Bruce, K., Cardelli, L., Castagna, G.: The Hopkins Object Group, Gary T. Leavens, and Benjamin Pierce. On binary methods. Theory and Practice of Object Systems 1(3), 221-242 (1995)
5. Burton, F.W., Cameron, R.D.: Pattern matching with abstract data types. Journal of Functional Programming 3(2), 171-190 (1993)
6. Burton, W., Meijer, E., Sansom, P., Thompson, S., Wadler, P.: Views: An extension to Haskell pattern matching (October 1996), http://www.haskell.org/ development/views.html
7. Cockett, R., Fukushima, T.: About Charity. Department of Computer Science, University of Calgary (May 1992)
8. Cook, W.R.: Object-oriented programming versus abstract data types. In: de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1990. LNCS, vol. 489, pp. 151-178. Springer, Heidelberg (1991)
9. Coutts, D., Leshchinskiy, R., Stewart, D.: Stream fusion: From lists to streams to nothing at all. In: International Conference on Functional Programming, pp. 315-326 (2007)
10. Dijkstra, E.W.: The humble programmer. Communications of the ACM 15(10), 859-866 (1972), http://www.cs.utexas.edu/~EWD/transcriptions/EWD03xx/EWD340.html
11. Emir, B., Odersky, M., Williams, J.: Matching Objects with Patterns. In: Ernst, E. (ed.) ECOOP 2007. LNCS, vol. 4609, pp. 273-298. Springer, Heidelberg (2007)
12. Erwig, M.: Categorical Programming with Abstract Data Types. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 406-421. Springer, Heidelberg (1998)
13. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading (1995)
14. Gibbons, J.: Datatype-generic programming. In: Backhouse, R., Gibbons, J., Hinze, R., Jeuring, J. (eds.) SSDGP 2006. LNCS, vol. 4719. Springer, Heidelberg (2007)
15. Gibbons, J., Hutton, G.: Proof methods for corecursive programs. Fundamenta Informaticae 66(4), 353-366 (2005)
16. Gibbons, J., Jones, G.: The under-appreciated unfold. In: International Conference on Functional Programming, Baltimore, Maryland, pp. 273-279 (September 1998)
17. Gill, A.: Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow (1998)
18. Gill, A., Launchbury, J., Jones, S.P.: A short cut to deforestation. In: Functional Programming Languages and Computer Architecture (1993)
19. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989), http://www.monad.me.uk/stable/Proofs+Types.html
20. Goguen, J., Malcolm, G.: Hidden coinduction: Behavioural correctness proofs for objects. Mathematical Structures in Computer Science 9, 287-319 (1999)
21. Gordon, A.D.: A tutorial on co-induction and functional programming. In: Glasgow Workshop on Functional Programming (1994)
22. Howe, D.: Free on-line dictionary of computing (1993), http://foldoc.org
23. Jacobs, B.: Objects and classes, coalgebraically. In: Freitag, B., Jones, C.B., Lengauer, C., Schek, H.-J. (eds.) Object-Orientation with Parallelism and Persistence, pp. 83-103. Kluwer, Dordrecht (1996)
24. Jacobs, B.: Coalgebras in specification and verification for object-oriented languages. Newsletter of the Dutch Association for Theoretical Computer Science (NVTI) 3, 15-27 (1999)
25. Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science (62), 222-259 (1997)
26. Kamin, S.: Final data types and their specification. ACM Transactions on Programming Languages and Systems 5(1), 97-123 (1983)
27. R.B. Kieburtz.: Codata and comonads in Haskell. Oregon Graduate Institute (unpublished manuscript, 1999)
28. Läufer, K., Odersky, M.: An extension of ML with first-class abstract types. In: SIGPLAN Workshop on ML and its Applications (June 1992)
29. Läufer, K., Odersky, M.: Polymorphic type inference and abstract data types. ACM Transactions on Programming Languages and Systems 16(5), 1411-1430 (1994)
30. Liskov, B., Zilles, S.: Programming with abstract data types. In: ACM SIGPLAN Symposium on Very High Level Languages, pp. 50-59. ACM Press, New York (1974)
31. Mitchell, J.C.: On the equivalence of data representations. In: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 305-329. Academic Press Professional, Inc., San Diego (1991)
32. Mitchell, J.C., Plotkin, G.D.: Abstract types have existential type. ACM Transactions on Programming Languages and Systems 10(3), 470-502 (1988)
33. Németh, L.: Catamorphism Based Program Transformations for Non-Strict Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow (2000)
34. Okasaki, C.: Views for Standard ML. In: SIGPLAN Workshop in ML, pp. 14-23 (1998)
35. Gostanza, P.P., Peña, R., Núñez, M.: A new look at pattern matching in abstract data types. In: International Conference on Functional Programming, pp. 110-121. ACM Press, New York (1996)
36. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167-183. Springer, Heidelberg (1981)
37. Parnas, D.L.: On the criteria to be used in decomposing systems into modules. Communications of the ACM 15(12), 1053-1058 (1972)
38. Paterson, R.: Haskell hierarchical libraries: Data.Sequence (accessed, 2007), http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Sequence. html
39. Jones, S.P.: Explicit quantification in Haskell (1998), http://research.microsoft.com/~simonpj/Haskell/quantification.html
40. Jones, S.P.: The Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003)
41. Jones, S.P.: View patterns: Lightweight views for Haskell (January 2007), http://hackage.haskell.org/trac/ghc/wiki/ViewPatternsArchive
42. Jones, S.P., Tolmach, A., Hoare, T.: Playing by the rules: Rewriting as a practical optimisation technique in GHC. In: Hinze, R. (ed.) Haskell Workshop (2001)
43. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)
44. Plotkin, G., Abadi, M.: A logic for parametric polymorphism. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 361-375. Springer, Heidelberg (1993)
45. Reichel, H.: An approach to object semantics based on terminal co-algebras. Mathematical Structures in Computer Science 5, 129-152 (1995)
46. Reynolds, J.C.: Towards a theory of type structure. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol. 19, pp. 408-425. Springer, Heidelberg (1974)
47. Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing, vol. 83, pp. 513-523. Elsevier, Amsterdam (1983)
48. Svenningsson, J.: Shortcut fusion for accumulating parameters and zip-like functions. In: International Conference on Functional Programming (2002)
49. Syme, D., Neverov, G., Margetson, J.: Extensible pattern matching via a lightweight language extension. In: International Conference on Functional Programming, pp. 29-40 (2007)
50. Thompson, S.: Higher-order + polymorphic = reusable. Technical Report 224, University of Kent at Canterbury (May 1997), http://www.cs.kent.ac.uk/pubs/ 1997/224/
51. Tullsen, M.: First Class Patterns. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol. 1753, pp. 1-15. Springer, Heidelberg (2000)
52. Turner, D.A.: Elementary strong functional programming. In: Hartel, P.H., Plasmeijer, R. (eds.) FPLE 1995. LNCS, vol. 1022. Springer, Heidelberg (1995)
53. Turner, D.A.: Total functional programming. Journal of Universal Computer Science 10(7), 751-768 (2004)
54. Ungar, D., Smith, R.B.: Self: The power of simplicity. In: Object-Oriented Programming: Systems, Languages and Applications, pp. 227-242 (1987)
55. Wadler, P.: A critique of Abelson and Sussman: Why calculating is better than scheming. SIGPLAN Notices 22(3), 8 (1987)
56. Wadler, P.: Views: A way for mattern matching to cohabit with data abstraction. In: Principles of Programming Languages, pp. 307-313. ACM Press, New York (1987)
57. Wadler, P.: Theorems for free! In: Functional Programming Languages and Computer Architecture, pp. 347-359. ACM, New York (1989)
58. Wadler, P.: Recursive types for free! (July 1990) (unpublished manuscript), http://homepages.inf.ed.ac.uk/wadler/papers/free-rectypes/free- rectypes.txt
59. Wand, M.: Final algebra semantics and data type extensions. Journal of Computer and System Sciences 19, 27-44 (1979)
60. Wang, D.C., Murphy VII, T.: Programming with recursion schemes. Agere Systems/ Carnegie Mellon University (unpublished manuscript, 2002)
61. Wang, M., Gibbons, J.: Translucent abstraction: Algebraic datatypes with safe views (April 2008) (submitted)
62. Wraith, G.: A note on categorical datatypes. In: Pitt, D.H., Rydeheard, D.E., Dyjber, P., Pitts, A.M., Poigné, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389. Springer, Heidelberg (1989)