C. Böhm and A. Berarducci. Automatic synthesis of typed Λ-programs on term algebras. Theoretical Computer Science
, 39:135–154, 1985.MATHCrossRefMathSciNetGoogle Scholar
Thierry Coquand. A new paradox in type theory. In Dag Prawitz, Brian Skyrms, and Dag Westerståhl, editors, Logic, methodology and philosophy of science IX: proceedings of the Ninth International Congress of Logic, Methodology, and Philosophy of Science, Uppsala, Sweden, August 7-14, 1991, Amsterdam, 1994. Elsevier.
Thierry Coquand and Christin Paulin. Inductively defined types. In P. Martin-Löf and G. Mints, editors, COLOG-88 International Conference on Computer Logic
, volume 417 of Lecture Notes in Computer Science
, pages 50–66, Tallinn, USSR, December 1988. Springer-Verlag.Google Scholar
Karl Crary and Stephanie Weirich. Flexible type analysis. In 1999 ACM International Conference on Functional Programming, pages 233–248, Paris, September 1999.
Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type erasure semantics. In 1998 ACM International Conference on Functional Programming
, volume 34 of ACM SIGPLAN Notices
, pages 301–313, Baltimore, MD, September 1998. Extended Version is Cornell University Computer Science TR98-1721.CrossRefGoogle Scholar
Olivier Danvy. Type-directed partial evaluation. In Twenty-Third ACM Symposium on Principles of Programming Languages, January 1996.
Peter Dybjer. Inductive sets and families in Martin-Löf’s type theory and their set-theoretic semnatics. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 280–306. Prentice Hall, 1991.
Jean-Yves Girard. Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur. PhD thesis, Université Paris VII, 1972.
Robert Harper and Greg Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM Symposium on Principles of Programming Languages, pages 130–141, San Francisco, January 1995.
A. J. C. Hurkens. A simplification of girard’s paradox. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Second International Conference on Typed Lambda Calculi and Applications, TLCA’ 95
, volume 902 of Lecture Notes in Computer Science
, Edinburgh, United Kingdom, April 1995. Springer-Verlag.Google Scholar
Lambert G. L. T. Meertens. Paramorphisms. Formal Aspects of Computing
, 4(5):413–424, 1992.MATHCrossRefGoogle Scholar
E. Meijer, M.M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA91: Functional Programming Languages and Computer Architecture
, volume 523 of Lecture Notes in Computer Science
, pages 124–144. Springer-Verlag, 1991.Google Scholar
Paul Francis Mendler. Inductive Definition in Type Theory
. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, September 1987.Google Scholar
Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised)
. The MIT Press, Cambridge, Massachusetts, 1997.Google Scholar
John C. Mitchell. Foundations for Programming Languages. The MIT Press, 1996.
C. Paulin-Mohring. Inductive definitions in the system Coq-rules and properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications
, number 664 in Lecture Notes in Computer Science, 1993. LIP research report 92-49.CrossRefGoogle Scholar
Simon L. Peyton Jones and J. Hughes (editors). Report on the programming language Haskell 98, a non-strict purely functional language. Technical Report YALEU/DCS/RR-1106, Yale University, Department of Computer Science, February 1999. Available from http://www.haskell.org/definition/
F. Pfenning and C. Paulin-Mohring. Inductively defined types in the Calculus of Constructions. In Proceedings of Mathematical Foundations of Programming Semantics
, volume 442 of Lecture Notes in Computer Science
. Springer-Verlag, 1990.Google Scholar
Gordon Plotkin and Martín Abadi. A logic for parametric polymorphism. In International Conference on Typed Lambda Calculi and Applications, pages 361–375, 1993.
John C. Reynolds. Polymorphism is not set-theoretic. In Proceedings of the International Symposium on Semantics of Data Types
, volume 173 of Lecture Notes in Computer Science
. Springer-Verlag, 1984.Google Scholar
Bratin Saha, Valery Trifonov, and Zhong Shao. Fully reflexive intensional type analysis in type erasure semantics. In Third Workshop on Types in Compilation, Montreal, September 2000.
Zdzisław Spławski and Paweł Urzyczyn. Type fixpoints: Iteration vs. recursion. In Fourth ACM International Conference on Functional Programming, pages 102–113, Paris, France, September 1999.
Valery Trifonov, Bratin Saha, and Zhong Shao. Fully reflexive intensional type analysis. In Fifth ACM International Conference on Functional Programming, pages 82–93, Montreal, September 2000. Extended version is YALEU/DCS/TR-1194.
Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACM Symposium on Principles of Programming Languages, pages 60–76. ACM, 1989.
Zhe Yang. Encoding types in ML-like languages. In 1998 ACM International Conference on Functional Programming
, volume 34 of ACM SIGPLAN Notices
, pages 289–300, Baltimore, MD, September 1998.CrossRefGoogle Scholar