Lennart Augustsson
ABSTRACT
Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value, and types of record components (which can be types or values) may depend on other components. Cayenne also combines the syntactic categories for value expressions and type expressions; thus reducing the number of language concepts.Having dependent types and combined type and value expressions makes the language very powerful. It is powerful enough that a special module concept is unnecessary; ordinary records suffice. It is also powerful enough to encode predicate logic at the type level, allowing types to be used as specifications of programs. However, this power comes at a cost: type checking of Cayenne is undecidable. While this may appear to be a steep price to pay, it seems to work well in practice.
References
- ACN90.L. Augustsson, T. Coquand, and B. NordstrSm. A short description of Another Logical Framework. In Proceedings of the First Workshop on Logical Frameworks, Antibes, pages 39-42, 1990.Google Scholar
- AJ89.L. Augustsson and T. Johnsson. The Chalmers Lazy-ML Compiler. The Computer Journal, 32(2):127-141, 1989. Google Scholar
- Aug93.Lenn~rt Augustsson. Implementing Haskell Overloading. ill Proc. 6th Int'l Conf. on Functional Programming Languages and Computer Architecture (FPCA'93), p~ges 65-73. ACM Press, June 1993. Google Scholar
- BDD89.H. Boehm, A. Demers, and J. Donahue. A Programmer's Introduction to Russell. Technical report, Cornell University, 1989.Google Scholar
- Bet98.Gustavo Betarte. Dependent Record Types and Algebraic Structures in Type Theory. PhD thesis, Department of Computing Science, University of GSteborg, GSteborg, Sweden, February 1998.Google Scholar
- Car88.Luca Gardelli. Phase Distinction in Type Theory. Research report, DEC SRC, 1988.Google Scholar
- Car94.Luca Cardelli. The Quest Language and System. Research report, DEC SRC, 1994.Google Scholar
- CH86.Thierry Coquand and G~rard Huet. The Calculus of Constructions. Technical Report 530, INRIA, Centre de Rocquencourt, 1986.Google Scholar
- CH88.Thierry Coquand and G~rard Huet. The Calculus of Constructions. Information and Computation, 76(2/3):9,5-120, 1988. Google Scholar
- Con86.R.L. Constable et al. Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, Englewood Cliffs, NJ, 1986. Google Scholar
- Dan98.Olivier Danvy. Formatting Strings in ML. Technical Report RS-98-5, BRICS, Department of Computer SCience, University of Aarhus, Denmark, March 1998.Google Scholar
- Fra91.Logical Frameworks. Logic programming in the LF logical framework. In G~rard Huet and Gordon Plotkin, editors, L{CS'89, pages 149-181. Cambridge University Press, 1991. Google Scholar
- HHP93.Robert Harper, Furio Honsell, and Gordon Plotkin. A Framework for Defining Logics. JACM, 40(1):143-184, 1993. Google Scholar
- How80.W.A. Howard. Tile formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Uombinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, London, 1980.Google Scholar
- Hud92.Paul Hudak et al. Report on the Programming Language Haskell: A Non-Strict, Purely Functional Language, March 1992. Version 1.2. Also in Sigplan Notices, May 1992. Google Scholar
- Jon94.Mark P. Jones. The implementation of the Gofer filnctional programming system. Technical Report YALEU/DCS/RR-1030, Department of Computer Science, Yale University, New Haven, Connecticut, USA, May 1994, May 94.Google Scholar
- Lil97.Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, May 1997. CM U-CS-97-122.Google Scholar
- LP92.Z. Luo and R. Pollack. LEGO Proof Development System: User's Manual. Technical report, LFCS Technical Report ECS-LFCS-92- 211, 1992.Google Scholar
- MN94.Lena Magnusson and Bengt NordstrSm. The ALF proof editor and its proof engine. In Types for Proofs and Programs, LNCS, pages 213-237, Nijmegen, 1994. Springer-Verlag. Google Scholar
- Mor95.Greg Morrisett. Compiling with Types. PhD thesis, Carnegie Mellon University, 1995.Google Scholar
- MTH90.R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990. Google ScholarDigital Library
- Nor93.Bengt NordstrSm. The ALF proof editor. In Proceedings 1993 Informal Proceedings of the Nijmegen workhop on Types for Proofs and Programs, 1993.Google Scholar
- NPS90.Bengt Nordstrsm, Kent Petersson, and Jan M. Smith. Programming in Martin-LSf 's Type Theory. An Introduction. Oxford University Press, 1990. Google Scholar
- Pfe89.Frank Pfenning. Elf: A language for logic definition and verified meta-programming. In LICS'89, pages 313-322. IEEE, June 1989. Google Scholar
- PJ93.John Peterson and Mark P. Jones. Implementing Type Classes. In Proceedings of A CM SIGPLAN Symposium on Programming Language Design and Implementation, June 1993. Google Scholar
- Pol94.Robert Pollack. The Theory of Lego A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994.Google Scholar
- TMC+96.David Tarditi, Greg Morrisett, Pery Cheng, Chris Stone, Robert Harper, and Peter Lee. TIL: A Type-directed Optimizing Compiler for ML. Technical Report CMU-CS-96-108, School of Computer Science, Carnegie Mellon University, February 1996.Google Scholar
Index Terms
Cayenne—a language with dependent types
Comments