Theorems for free!

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Theorems for free!

Full text

Pdf (1.24 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the fourth international conference on Functional programming languages and computer architecture table of contents

Imperial College, London, United Kingdom

Pages: 347 - 359

Year of Publication: 1989

ISBN:0-89791-328-0

Author

Philip Wadler

Department of Computing Science, University of Glasgow, G12 SQQ, Scotland

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 25, Downloads (12 Months): 153, Citation Count: 100

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/99370.99404 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BCGS89	V. Breazu-Tannen , T. Coquand , C. Gunter , A. Scedrov, Inheritance and explicit coercion, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.112-129, June 1989, Pacific Grove, California, United States
	BFSS87	E. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott, Functorial polymorphism. In G. Huet, editor, Logical Foundations of Functional Programming, Austin, Texas, 1987. Addison-Wesley, to appear.
	BM84	Kim B. Bruce , Albert R. Meyer, The semantics of second order polymorphic lambda calculus., Proc. of the international symposium on Semantics of data types, p.131-156, July 1984, Sophia-Antipolis, France
	BTC88	V. Breazu-Tannen , T. Coquand, Extensional models for polymorphism, Theoretical Computer Science, v.59 n.1-2, p.85-114, July 1988 [doi>10.1016/0304-3975(88)90097-7]
	BW86	G. Barrett and P. Wadler, Derivation of a pattern-matching compiler. Manuscript, Programming Research Group, Oxford, 1986.
	BW88	Richard Bird , Philip Wadler, An introduction to functional programming, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1988
	DM82	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	deB89	P.J. deBruin, Naturalness of polymorphism. Submitted to Category Theory and Computer Science, Manchester, 1989.
	FGSS88	P. J. Freyd, J. Y. Girard, A. Scedrov, and P. J. Scott, Semantic parametricity in polymorphic lambda calculus. In $'rd A~nual Symposium on Logic in Computer Science, Edinburgh, Scotland, June 1988.
	FLO83	Steven Fortune , Daniel Leivant , Michael O'Donnell, The Expressiveness of Simple and Second-Order Type Structures, Journal of the ACM (JACM), v.30 n.1, p.151-185, Jan. 1983 [doi>10.1145/322358.322370]
	Gir72	J.-Y. Girard, Interpretation fu~ctior~elle et $limination des coupures dens l~arithm~tique d'ordre sup~rieure. Ph.D. thesis, Universit~ Paris VII, 1972.
	Gir86	Jean-Yves Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, v.45 n.2, p.159-192, Sept. 1986
	GLT89	Jean-Yves Girard , Paul Taylor , Yves Lafont, Proofs and types, Cambridge University Press, New York, NY, 1989
	Hin69	R. Hindley, The principal type scheme of an object in combinatory logic. Trans. Am. M~tk. Soc. i~6, pp. 29-60, December 1969.
	HW88	P. Hudak and P. Wadler, editors, Report on the Functional Programming Language HazkeIL Technical Report YALEU/DCS/ RR656, Yale University, Department of Computer Science, December 1988; also Technical Report, Glasgow University, Department of Computer Science, December 1988.
	Mes89	J. Meseguer, Relating models of polymorphism, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.228-241, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75297]
	Mil78	R. Milner, A theory of type polymorphism in programming. J. ~orapgt. $yst. $ci. 17, pp. 348-375, 1978.
	Mil84	Robin Milner, A proposal for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.184-197, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802035]
	Mil87	R. Milner, Changes to the Standard ML core language. Report ECS-LFCS-87-33, Edinburgh University, Computer Science Dept., 1987.
	Mit86	John C. Mitchell, Representation independence and data abstraction, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.263-276, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512669]
	MM85	John C. Mitchell , Albert R. Meyer, Second-Order Logical Relations (Extended Abstract), Proceedings of the Conference on Logic of Programs, p.225-236, June 17-19, 1985
	Pit87	Andrew M. Pitts, Polymorphism is Set Theoretic, Constructively, Category Theory and Computer Science, p.12-39, September 07-09, 1987
	Rey74	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	Rey83	J.C. Reynolds, Types, abstraction, and parametric polymorphism, in R. E. A. Mason, editor, Information Processing 83, pp. 513-523. North-Holland, Amsterdam.
	Rey84	J.C. Reynolds, Polymorphism is not set theoretic. In Kahn, MacQueen, and Plotkin, editors, Semantics of Data Types, Sophia- Antipolis, France, 1984, pp. 145-156. LNCS 173, Springer-Verlag.
	Rey85	J C Reynolds, Three approaches to type structure, Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85), p.97-138, April 1985, Berlin, Germany
	She89	Mary Sheeran, Categories for the working hardware designer, Proceedings of the Mathematical Sciences Institute workshop on Hardware specification, verification and synthesis: mathematical aspects, p.380-402, February 1990, Ithaca, New York, United States
	Tur85	D. A. Turner, Miranda: a non-strict functional language with polymorphic types, Proc. of a conference on Functional programming languages and computer architecture, p.1-16, January 1985, Nancy, France
	WB89	P. Wadler , S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.60-76, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75283]

CITED BY 100

	QingMing Ma, Parametricity as subtyping, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.281-292, January 19-22, 1992, Albuquerque, New Mexico, United States
	Olivier Danvy , Karoline Malmkjær , Jens Palsberg, Eta-expansion does The Trick, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.6, p.730-751, Nov. 1996
	Karl Crary, A simple proof technique for certain parametricity results, ACM SIGPLAN Notices, v.34 n.9, p.82-89, Sept. 1999
	Rajiv Mirani , Paul Hudak, First-class schedules and virtual maps, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.78-85, June 26-28, 1995, La Jolla, California, United States
	Leonidas Fegaras , Tim Sheard, Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space), Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.284-294, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Guy L. Steele, Jr., Building interpreters by composing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.472-492, January 16-19, 1994, Portland, Oregon, United States
	Andrew J. Kennedy, Relational parametricity and units of measure, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.442-455, January 15-17, 1997, Paris, France
	Martin Odersky , Christoph Zenger , Matthias Zenger, Colored local type inference, ACM SIGPLAN Notices, v.36 n.3, p.41-53, March 2001
	Koji Kagawa, Compositional references for stateful functional programming, ACM SIGPLAN Notices, v.32 n.8, p.217-226, Aug. 1997
	Stephanie Weirich, Type-safe cast: (functional pearl), ACM SIGPLAN Notices, v.35 n.9, p.58-67, Sept. 2000
	Akihiko Takano , Erik Meijer, Shortcut deforestation in calculational form, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.306-313, June 26-28, 1995, La Jolla, California, United States
	Philip Wadler, Comprehending monads, Proceedings of the 1990 ACM conference on LISP and functional programming, p.61-78, June 27-29, 1990, Nice, France
	Pascal Fradet, Collecting more garbage, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.24-33, July-Sept. 1994
	James Cheney , Ralf Hinze, A lightweight implementation of generics and dynamics, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.90-104, October 03, 2002, Pittsburgh, Pennsylvania
	Erik Meijer , Graham Hutton, Bananas in space: extending fold and unfold to exponential types, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.324-333, June 26-28, 1995, La Jolla, California, United States
	Fritz Henglein , Jesper Jørgensen, Formally optimal boxing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.213-226, January 16-19, 1994, Portland, Oregon, United States
	Ralf Hinze, A new approach to generic functional programming, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-132, January 19-21, 2000, Boston, MA, USA
	Levent Erkök , John Launchbury, Recursive monadic bindings, ACM SIGPLAN Notices, v.35 n.9, p.174-185, Sept. 2000
	Geoffrey Washburn , Stephanie Weirich, Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism, ACM SIGPLAN Notices, v.38 n.9, p.249-262, September 2003
	David Sands, Total correctness by local improvement in the transformation of functional programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.2, p.175-234, March 1996
	Spiro Michaylov , Frank Pfenning, Compiling the polymorphic &lgr;-calculus, ACM SIGPLAN Notices, v.26 n.9, p.285-296, Sept. 1991
	Olaf Chitil, Typer inference builds a short cut to deforestation, ACM SIGPLAN Notices, v.34 n.9, p.249-260, Sept. 1999
	Christian Mossin, Higher-order value flow graphs, Nordic Journal of Computing, v.5 n.3, p.214-234, Fall 1998
	Andrew Gill , John Launchbury , Simon L. Peyton Jones, A short cut to deforestation, Proceedings of the conference on Functional programming languages and computer architecture, p.223-232, June 09-11, 1993, Copenhagen, Denmark
	P. W. O'Hearn , R. D. Tennent, Parametricity and local variables, Journal of the ACM (JACM), v.42 n.3, p.658-709, May 1995
	Catriel Beeri , Tova Milo , Paula Ta-Shma, On genericity and parametricity (extended abstract), Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.104-116, June 04-06, 1996, Montreal, Quebec, Canada
	Simon Peyton Jones , Mark Shields , John Launchbury , Andrew Tolmach, Bridging the gulf: a common intermediate language for ML and Haskell, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 19-21, 1998, San Diego, California, United States
	John Launchbury, Strictness and binding-time analyses: two for the price of one, ACM SIGPLAN Notices, v.26 n.6, p.80-91, June 1991
	Hayo Thielecke, From control effects to typed continuation passing, ACM SIGPLAN Notices, v.38 n.1, p.139-149, January 2003
	Josef Svenningsson, Shortcut fusion for accumulating parameters & zip-like functions, ACM SIGPLAN Notices, v.37 n.9, p.124-132, September 2002
	Philip Wadler, The Girard--Reynolds isomorphism, Information and Computation, v.186 n.2, p.260-284, 01 November 2003
	Eijiro Sumii , Benjamin C. Pierce, Logical relation for encryption, Journal of Computer Security, v.11 n.4, p.521-554, 01/01/2004
	Patricia Johann , Janis Voigtländer, Free theorems in the presence of seq, ACM SIGPLAN Notices, v.39 n.1, p.99-110, January 2004
	Stephen Tse , Steve Zdancewic, Translating dependency into parametricity, ACM SIGPLAN Notices, v.39 n.9, September 2004
	Walid Taha , Michael Florentin Nielsen, Environment classifiers, ACM SIGPLAN Notices, v.38 n.1, p.26-37, January 2003
	John C. Reynolds, An introduction to logical relations and parametric polymorphism (abstract), Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.155-156, March 1993, Charleston, South Carolina, United States
	Koen Claessen , John Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, ACM SIGPLAN Notices, v.35 n.9, p.268-279, Sept. 2000
	Kohei Honda , Nobuko Yoshida, A compositional logic for polymorphic higher-order functions, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.191-202, August 24-26, 2004, Verona, Italy
	Rajiv Mirani , Paul Hudak, First-class monadic schedules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.4, p.609-651, July 2004
	Kevin Backhouse , Roland Backhouse, Safety of abstract interpretations for free, via logical relations and Galois connections, Science of Computer Programming, v.51 n.1-2, p.153-196, May 2004
	Arthur I. Baars , S. Doaitse Swierstra, Type-safe, self inspecting code, Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, September 22-22, 2004, Snowbird, Utah, USA
	Tyng-Ruey Chuang , Jan-Li Lin, On modular transformation of structural content, Proceedings of the 2004 ACM symposium on Document engineering, October 28-30, 2004, Milwaukee, Wisconsin, USA
	Chung-chieh Shan, Sexy types in action, ACM SIGPLAN Notices, v.39 n.5, May 2004
	Janis Voigtländer, Concatenate, reverse and map vanish for free, ACM SIGPLAN Notices, v.37 n.9, p.14-25, September 2002
	Susumu Nishimura, Fusion with stacks and accumulating parameters, Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.101-112, August 24-25, 2004, Verona, Italy
	Eijiro Sumii , Benjamin C. Pierce, A bisimulation for type abstraction and recursion, ACM SIGPLAN Notices, v.40 n.1, p.63-74, January 2005
	Peter Møller Neergaard , Harry G. Mairson, Types, potency, and idempotency: why nonlinearity and amnesia make a type system work, ACM SIGPLAN Notices, v.39 n.9, September 2004
	Patricia Johann, A Generalization of Short-Cut Fusion and its Correctness Proof, Higher-Order and Symbolic Computation, v.15 n.4, p.273-300, December 2002
	Hayo Thielecke, Frame rules from answer types for code pointers, ACM SIGPLAN Notices, v.41 n.1, p.309-319, January 2006
	Bruno C. d. S. Oliveira , Jeremy Gibbons, TypeCase: a design pattern for type-indexed functions, Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, p.98-109, September 30-30, 2005, Tallinn, Estonia
	Nils Anders Danielsson , John Hughes , Patrik Jansson , Jeremy Gibbons, Fast and loose reasoning is morally correct, ACM SIGPLAN Notices, v.41 n.1, p.206-217, January 2006
	Dan Grossman, Quantified types in an imperative language, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.3, p.429-475, May 2006
	Paulo F. Silva , José N. Oliveira, 'Galculator': functional prototype of a Galois-connection based proof assistant, Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, July 15-17, 2008, Valencia, Spain
	Martín Abadi, ⊤⊤-closed relations and admissibility, Mathematical Structures in Computer Science, v.10 n.3, p.313-320, June 2000
	Andrew M. Pitts, Parametric polymorphism and operational equivalence, Mathematical Structures in Computer Science, v.10 n.3, p.321-359, June 2000
	Andreas Abel , Ralph Matthes , Tarmo Uustalu, Iteration and coiteration schemes for higher-order and nested datatypes, Theoretical Computer Science, v.333 n.1-2, p.3-66, 1 March 2005
	Dimitrios Vytiniotis , Stephanie Weirich, Free Theorems and Runtime Type Representations, Electronic Notes in Theoretical Computer Science (ENTCS), 173, p.357-373, April, 2007
	Karl Crary , Robert Harper, Syntactic Logical Relations for Polymorphic and Recursive Types, Electronic Notes in Theoretical Computer Science (ENTCS), 172, p.259-299, April, 2007
	Karl Crary , Robert Harper, Syntactic Logical Relations for Polymorphic and Recursive Types, Electronic Notes in Theoretical Computer Science (ENTCS), 172, p.259-299, April, 2007
	Shin-ya Katsumata , Susumu Nishimura, Algebraic fusion of functions with an accumulating parameter and its improvement, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Jeremy Gibbons, Design patterns as higher-order datatype-generic programs, Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming, September 16-16, 2006, Portland, Oregon, USA
	Andreas Rossberg, The missing link: dynamic components for ML, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Eijiro Sumii , Benjamin C. Pierce, A bisimulation for type abstraction and recursion, Journal of the ACM (JACM), v.54 n.5, p.26-es, October 2007
	Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California
	Arjun Guha , Jacob Matthews , Robert Bruce Findler , Shriram Krishnamurthi, Relationally-parametric polymorphic contracts, Proceedings of the 2007 symposium on Dynamic languages, October 22-22, 2007, Montreal, Quebec, Canada
	Andrzej Filinski, On the relations between monadic semantics, Theoretical Computer Science, v.375 n.1-3, p.41-75, May, 2007
	Stephanie Weirich, Type-safe run-time polytypic programming, Journal of Functional Programming, v.16 n.6, p.681-710, November 2006
	Stephen Tse , Steve Zdancewic, Run-time principals in information-flow type systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.1, p.6-es, November 2007
	Maric García De La Banda , Warwick Harvey , Kim Marriott , Peter J. Stuckey , Bart Demoen, Checking modes of HAL programs, Theory and Practice of Logic Programming, v.5 n.6, p.623-667, November 2005
	Janis Voigtländer , Patricia Johann, Selective strictness and parametricity in structural operational semantics, inequationally, Theoretical Computer Science, v.388 n.1-3, p.290-318, December, 2007
	Ralf Hinze, Generics for the masses, Journal of Functional Programming, v.16 n.4-5, p.451-483, July 2006
	Richard Bird , Sharon Curtis, FUNCTIONAL PEARLS: Finding celebrities: A lesson in functional programming, Journal of Functional Programming, v.16 n.1, p.13-20, January 2006
	Patricia Johann , Janis Voigtländer, The Impact of seq on Free Theorems-Based Program Transformations, Fundamenta Informaticae, v.69 n.1-2, p.63-102, January 2006
	Patricia Johann, On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi, Mathematical Structures in Computer Science, v.15 n.2, p.201-229, April 2005
	Lars Birkedal , Rasmus E. Møgelberg, Categorical models for Abadi and Plotkin's logic for parametricity, Mathematical Structures in Computer Science, v.15 n.4, p.709-772, August 2005
	Harry G. Mairson, Linear lambda calculus and PTIME-completeness, Journal of Functional Programming, v.14 n.6, p.623-633, November 2004
	Ralf Hinze, THEORETICAL PEARL Church numerals, twice!, Journal of Functional Programming, v.15 n.1, p.1-13, January 2005
	João Paulo Fernandes , Alberto Pardo , João Saraiva, A shortcut fusion rule for circular program calculation, Proceedings of the ACM SIGPLAN workshop on Haskell workshop, September 30-30, 2007, Freiburg, Germany
	Richard S. Bird , Ross Paterson, de Bruijn notation as a nested datatype, Journal of Functional Programming, v.9 n.1, p.77-91, January 1999
	Andrew Tolmach , Dino P. Oliva, From ML to Ada: Strongly-typed language interoperability via source translation, Journal of Functional Programming, v.8 n.4, p.367-412, July 1998
	Claus Jürgensen , Heiko Vogler, Syntactic composition of top-down tree transducers is short cut fusion, Mathematical Structures in Computer Science, v.14 n.2, p.215-282, April 2004
	Conor McBride , James McKinna, The view from the left, Journal of Functional Programming, v.14 n.1, p.69-111, January 2004
	Andrei Sabelfeld , David Sands, A Per Model of Secure Information Flow in Sequential Programs, Higher-Order and Symbolic Computation, v.14 n.1, p.59-91, March 2001
	Ralf Hinze, Formatting: a class act, Journal of Functional Programming, v.13 n.5, p.935-944, September 2003
	Patricia Johann, Short cut fusion is correct, Journal of Functional Programming, v.13 n.4, p.797-814, July 2003
	Ralf Hinze, Perfect trees and bit-reversal permutations, Journal of Functional Programming, v.10 n.3, p.305-317, May 2000
	Simon Peyton Jones , Philip Wadler, Comprehensive comprehensions, Proceedings of the ACM SIGPLAN workshop on Haskell workshop, September 30-30, 2007, Freiburg, Germany
	Janis Voigtländer, Much ado about two (pearl): a pearl on parallel prefix computation, ACM SIGPLAN Notices, v.43 n.1, January 2008
	Kevin Bierhoff , Jonathan Aldrich, Modular typestate checking of aliased objects, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Alan Jeffrey , Julian Rathke, Full abstraction for polymorphic π-calculus, Theoretical Computer Science, v.390 n.2-3, p.171-196, January, 2008
	Janis Voigtländer, Proving correctness via free theorems: the case of the destroy/build-rule, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
	Geoffrey Washburn , Stephanie Weirich, Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*, Journal of Functional Programming, v.18 n.1, p.87-140, January 2008
	Alberto Pardo , João Paulo Fernandes , João Saraiva, Shortcut fusion rules for the derivation of circular and higher-order monadic programs, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, January 19-20, 2009, Savannah, GA, USA
	Shin-ya Katsumata , Susumu Nishimura, Algebraic fusion of functions with an accumulating parameter and its improvement, Journal of Functional Programming, v.18 n.5-6, p.781-819, September 2008
	Patricia Johann , Janis Voigtländer, A family of syntactic logical relations for the semantics of Haskell-like languages, Information and Computation, v.207 n.2, p.341-368, February, 2009
	Lars Birkedal , Kristian Støvring , Jacob Thamsborg, Relational parametricity for references and recursive types, Proceedings of the 4th international workshop on Types in language design and implementation, January 24-24, 2009, Savannah, GA, USA
	Janis Voigtländer, Bidirectionalization for free! (Pearl), Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Ralf Hinze , Andres Löh, Generic programming in 3D, Science of Computer Programming, v.74 n.8, p.590-628, June, 2009
	Jeremy Gibbons , Bruno c. d. s. Oliveira, The essence of the iterator pattern, Journal of Functional Programming, v.19 n.3-4, p.377-402, July 2009
	Amal Ahmed , Robert Bruce Findler , Jacob Matthews , Philip Wadler, Blame for all, Proceedings for the 1st workshop on Script to Program Evolution, p.1-13, July 06-06, 2009, Genova, Italy