The view from the left

Journal of Functional Programming

Volumn 14, Issue 1, 2004, Pages 69-111

  McBride, Conor ^a   McKinna, James ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATATYPES; FUNCTIONAL PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; ERROR ANALYSIS; MATHEMATICAL OPERATORS; PATTERN MATCHING; SEMANTICS; THEOREM PROVING; USER INTERFACES;

COMPUTER PROGRAMMING;

EID: 0842289692     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004829     Document Type: Review

References (58)

1. Abel, A. and Altenkirch, T. (2000) A predicative analysis of structural recursion. J. Functional Program. 12(1):1-41
2. Altenkirch, T. and McBride, C. (2002) Generic programming within dependently typed programming. In: Gibbons, J. and Jeuring, J. (eds.), Proceedings IFIP 2.1 Working Conference on Generic Programming. Kluwer.
3. Altenkirch, T. and Reus, B. (1999) Monadic presentations of lambda-terms using generalized inductive types. Lecture Notes in Computer Science 1683, pp. 453-468. Springer-Verlag.
4. Augustsson, L. (1985). Compiling pattern matching. In: Jouannaud, J.-P. (ed.), Functional Programming Languages and Computer Architecture: LNCS 201, pp. 368-381. Springer-Verlag.
5. Augustsson, L. (1998) Cayenne - a language with dependent types. ACM International Conference on Functional Programming. ACM.
6. Augustsson, L. and Carlsson, M. (1999) An exercise in dependent types: A well-typed interpreter. Available at http://www.cs.chalmers.se/̃augustss/cayenne/interp.ps.
7. Barendregt, H. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. and Maibaum, T. (eds.), Handbook of Logic in Computer Science, vol. II. Oxford University Press.
8. Bird, R. and Meertens, L. (1998) Nested datatypes. Mathematics of Program Construction: LNCS 1422, pp. 52-67. Springer-Verlag.
9. Bird, R. and Paterson, R. (1999) de Bruijn notation as a nested datatype. J. Functional Program. 9(1), 77-92.
10. Bove, A. and Capretta, V. (2001) Nested general recursion and partiality in type theory. In: Boulton, R. and Jackson, P. (eds.), Theorem Proving in Higher Order Logics, TPHOLs 2001: LNCS 2152. Springer-Verlag.
11. Burstall, R. (1969) Proving properties of programs by structural induction. Comput. J. 12(1), 41-48.
12. Burton, W., Meijer, E., Samson, P., Thompson, S. and Wadler, P. (1996) Views: An Extension to Haskell Pattern Matching. Available from http://www.haskell.org/development/views.html.
13. Callaghan, P. and Luo, Z. (2000) Implementation techniques for inductive types in plastic. Proceedings TYPES'99: LNCS 1956, pp. 94-113. Springer-Verlag.
14. Clark, K. (1978) Negation as failure. In: Gallaire, H. and Minker, J. (eds.), Logic and Data Bases, pp. 292-322. Plenum Press.
15. Coq, L'Équipe (2001) The Coq Proof Assistant Reference Manual. http://pauillac.inria. fr/coq/doc/main.html.
16. Coquand, T. (1992) Pattern matching with dependent types. In: Nordström, B., Petersson, K. and Plotkin, G. (eds.), Electronic Proceedings of the Third Annual BRA Workshop on Logical Frameworks, Båstad, Sweden. Available at http://www.lfcs.informatics.ed.ac.uk/research/types-bra/proc/proc92.ps.gz.
17. Cornes, C. (1997) Conception d'un langage de haut niveau de répresentation de preuves. PhD thesis, Université Paris VII.
18. de Bruijn, N. G. (1972) Lambda Calculus notation with nameless dummies: a tool for automatic formula manipulation. Indagationes Mathematics, 34, 381-392.
19. de Bruijn, N. G. (1991) Telescopic mappings in typed lambda-calculus. Infor. & computation, 91, 189-204.
20. Dybjer, P. (1991) Inductive sets and families in Martin-Löf's Type Theory. In: Huet, G. and Plotkin, G. (eds.), Logical Frameworks. CUP.
21. Giménez, E. (1994) Codifying guarded definitions with recursive schemes. In: Dybjer, P., Nordström, B. and Smith, J. (eds.), Types for Proofs and Programs, '94: LNCS 996, pp. 39-59. Springer-Verlag.
22. Giménez, E. (1998) Structural recursive definitions in type theory. Proceedings of ICALP '98: LNCS 1443. Springer-Verlag.
23. Goguen, H. (1994) A Typed Operational Semantics for Type Theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh. Available from http://www.lfcs.informatics.ed.ac.uk/reports/94/ECS-LFCS-94-304/.
24. Harper, R. and Pollack, R. (1991) Type checking with universes. Theor. Comput. Sci. 89, 107-136.
25. Hofmann, M. and Streicher, T. (1994) A groupoid model refutes uniqueness of identity proofs. Proc. Ninth Annual Symposium on Logic in Computer Science (LICS), pp. 208-212. Paris, France. IEEE Press.
26. Huet, G. and Plotkin, G. (eds.) (1990) Electronic Proceedings of the First Annual BRA Workshop on Logical Frameworks (Antibes, France). Available at http://www.lfcs. informatics.ed.ac.uk/research/types-bra/proc/proc90.ps.gz.
27. Leijen, D. and Meijer, E. (1999) Domain specific embedded compilers. 2nd Conference on Domain-Specific Languages (DSL). USENIX. Available from http://www.cs.uu.nl/people/daan/papers/dsec.ps.
28. Luo, Z. (1990) ECC: An Extended Calculus of Constructions. PhD thesis, University of Edinburgh. Available from http://www.lfcs.informatics.ed.ac.uk/reports/90/ECS-LFCS-90-118/.
29. Luo, Z. (1994) Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press.
30. Luo, Z. and Pollack, R. (1992) LEGO Proof Development System: User's Manual. Technical report ECS-LFCS-92-211, Laboratory for Foundations of Computer Science, University of Edinburgh.
31. Magnusson, L. (1994) The implementation of ALF - A Proof Editor based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Chalmers University of Technology, Göteborg.
32. McAdam, B. J. (1999) Generalising techniques for type explanation. Scottish Functional Programming Workshop, pp. 243-252. Technical Report RM/99/9, Heriot-Watt Department of Computing and Electrical Engineering.
33. McBride, C. (1998) Inverting inductively defined relations in LEGO. In: Giménez, E. and Paulin-Mohring, C. (eds.), Types for Proofs and Programs, '96: LNCS 1512, pp. 236-253. Springer-Verlag.
34. McBride, C. (1999) Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh. Available from http://www.lfcs.informatics.ed.ac.uk/reports/00/ECS-LFCS-00-419/.
35. McBride, C. (2001) First-order unification by structural recursion. J. Functional Program, to appear.
36. McBride, C. (2002) Elimination with a Motive. In: Callaghan, P., Luo, Z., McKinna, J. and Pollack, R. (eds.), Types for Proofs and Programs: (Proceedings of the International Workshop, TYPES'00): LNCS 2277. Springer-Verlag.
37. McBride, F. (1970) Computer aided manipulation of symbols. PhD thesis, Queen's University of Belfast.
38. McKinna, J. (2002) Views for recursion. Workshop on Termination and Type Theory, Hindås, Sweden.
39. McKinna, J. and Pollack, R. (1993) Pure type systems formalized. In: Bezem, M. and Groote, J.-F. (eds.), Int. Conf. Typed Lambda Calculi and Applications TLCA'93: LNCS 664. Springer-Verlag.
40. McKinna, J. and Pollack, R. (1999) Some lambda calculus and type theory formalized. J. Automated Reason, (special issue on 'Formal proof'), 23, 373-409.
41. Milner, R., Tofte, M., Harper, R. and MacQueen, D. (1997) The Definition of Standard ML, revised edn. MIT Press.
42. Peyton Jones, S. (1997) A new view of guards. Available from http://research.microsoft. com/Users/simonpj/Haskell/guards.html.
43. Peyton Jones, S. and Erwig, M. (2000) Pattern guards and transformational patterns. Proc. 2000 Haskell Workshop. Available from http://research.microsoft.com/Users/simonpj/Haskell/pat.ps.gz.
44. Peyton Jones, S. and Hughes, J. (eds.) (1999) Haskell'98: A Non-Strict Functional Language. Available from http://www.haskell.org/definition.
45. Pollack, R. (1992) Implicit syntax. Available from ftp://ftp.dcs.ed.ac.uk/pub/lego/ImplicltSyntax.ps.Z. An earlier version of this paper appeared in (Huet & Plotkin, 1990).
46. Pollack, R. (1994) Incremental Changes in LEGO:1994. Available from ftp://ftp.dcs.ed. ac.uk/pub/lego/changes94.ps.gz.
47. Pollack, R. (1995) The Theory of LEGO. PhD thesis, University of Edinburgh. Available from http://www.Ifcs.informatics.ed.ac.uk/reports/95/ECS-LFCS-95-323/.
48. Pollack, R. (2000) Dependently typed records for representing mathematical structure. In: Aagard, M. and Harrison, J. (eds.), Theorem Proving in Higher Order Logics, TPHOLs 2000: LNCS 1869, Springer-Verlag.
49. Nordström, B., Petersson, K. and Smith, J. (1990) Programming in Martin-Löfs type theory: an introduction. Oxford University Press.
50. Severi, P. and Poll, E. (1994) Pure Type Systems with definitions. In: Nerode, A. and Matijasevič, Y. (eds.), Proceedings of LFCS'94: LNCS 813. Springer-Verlag.
51. Streicher, T. (1993) Investigations into intensional type theory. Habilitation Thesis, Ludwig Maximilians Universität.
52. Tamaki, H. and Sato, T. (1984) Unfold/fold transformation of logic programs. In: Tårnlund, S.-Å. (ed.), Proceedings 2nd International Logic Programming Conference.
53. van Benthem Jutting, B., McKinna, J. and Pollack, R. (1994) Checking algorithms for Pure Type Systems. In: Barendregt, H. and Nipkow, T (eds.), Types for Proofs and Programs, Selected papers from the Int. Workshop TYPES '93: LNCS 806. Springer-Verlag.
54. Voda, P. (2002) What do we gain by integrating a programming language with a theorem prover? Workshop on Termination and Type Theory, Hindås, Sweden.
55. Wadler, P. (1987) Views: A way for pattern matching to cohabit with data abstraction. Proceedings POPL '87. ACM.
56. Wadler, P. (1989) Theorems for Free! Proceedings FPCA '89. ACM.
57. Wadler, P. (1990) Deforestation: transforming programs to eliminate trees. Theor. Comput. Sci. (Special issue of selected papers from 2nd ESOP), 73, 231-248.
58. Xi, H. (1998) Dependent types in practical programming. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University.