A tutorial implementation of a dependently typed lambda calculus

Fundamenta Informaticae

Volumn 102, Issue 2, 2010, Pages 177-207

  Löh, Andres ^a   McBride, Conor ^b   Swierstra, Wouter ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^c Vector Fabrics ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CORE CALCULUS; DATA TYPE; HASKELL; TYPED LAMBDA CALCULUS;

COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS); PROGRAM INTERPRETERS;

CALCULATIONS;

EID: 77957292372     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2010-304     Document Type: Conference Paper

References (102)

1. Agha, G., Mason, I., Smith, S., Talcott, C.: A foundation for actor computation, Journal of Functional Programming, 7(1), 1997, 1-72.
2. Amey, P.: Correctness by construction: Better can also be cheaper, CrossTalk: The Journal of Defense Software Engineering, 15(3), 2002, 24-28.
3. Bhatti, S., Brady, E., Hammond, K., McKinna, J.: Domain specific languages (DSLs) for network protocols (position paper), Proc. of Workshops of 29th IEEE Int. Conf. on Distributed Computing Systems, ICDCS 2009 (Montreal, June 2009), IEEE Computer Society Press, 2009, 208-213.
4. Brady, E.: Practical Implementation of a Dependently Typed Functional Programming Language, PhD thesis, University of Durham, 2005.
5. Brady, E.: Ivor, a proof engine, Revised Selected Papers from 18th Int. Workshop on Implementation and Application of Functional Languages, IFL 2006 (Budapest, Sept. 2006) (Z. Horváth, V. Zsók, A. Butterfield, Eds.), Lect. Notes in Comput. Sci., 4449, Springer-Verlag, 2007, 145-162.
6. Brady, E., Hammond, K.: A dependently typed framework for static analysis of program execution costs, Revised Selected Papers from 17th Int. Workshop on Implementation and Application of Functional Languages, IFL 2005 (Dublin, Sept. 2005) (A. Butterfield, C. Grelck, F. Huch, Eds.), Lect. Notes in Comput. Sci., 4015, Springer-Verlag, 2006, 74-90.
7. Brady, E., Hammond, K.: A verified staged interpreter is a verified compiler, Proc. of 5th Int. Conf. on Generative Programming and Component Engineering, GPCE '06 (Portland, OR, Oct. 2006), ACM Press, 2006, 111-120.
8. Brady, E., McBride, C., McKinna, J.: Inductive families need not store their indices, Revised Selected Papers from Int. Workshop on Types for Proofs and Programs, TYPES 2003 (Torino, Apr.-May 2003) (S. Berardi, M. Coppo, F. Damiani, Eds.), Lect. Notes in Comput. Sci., 3085, Springer-Verlag, 2004, 115-129.
9. Butenhof, D. R.: Programming with POSIX Threads, Addison Wesley, 1997.
10. Coffman, E., Elphick, M., Shoshani, A.: System deadlocks, ACM Computing Surveys, 3(2), 1971, 67-78.
11. Czarnecki, K., O'Donnell, J., Striegnitz, J., Taha,W.: DSL implementation in MetaOCaml, Template Haskell, and C++, Revised Papers from Int. Seminar on Domain Specific Program Generation (Dagstuhl Castle, March 2003) (C. Lengauer, D. S. Batory, C. Consel, M. Odersky, Eds.), Lect. Notes in Comput. Sci., 3016, Springer-Verlag, 2004, 51-72.
12. Elliott, C., Hudak, P.: Functional reactive animation, Proc. of 2nd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '97 (Amsterdam, June 1997), ACM Press, 1997, 263-273.
13. Ennals, R.: Software Transactional Memory Should Not Be Abstraction Free, Technical report IRC-TR-06-052, Intel Research, 2006.
14. Goguen, H.: A Typed Operational Semantics for Type Theory, PhD Thesis, University of Edinburgh, 1994.
15. Hammond, K., Michaelson, G.: Hume: A domain-specific language for real-time embedded systems, Proc. of 2nd Int. Conf. on Generative Programming and Component Engineering, GPCE '03 (F. Pfenning, Y. Smaragdakis, Eds.), Lect. Notes in Comput. Sci., 2830, Springer-Verlag, 2003, 37-56.
16. Hancock, P., Setzer, A.: Interactive programs in dependent type theory, Proc. of 14th Annual Conf. of EACSL, CSL 2000 (Fischbachau, Aug. 2000) (P. Clote, H. Schwichtenberg, Eds.), Lect. Notes in Comput. Sci., 1862, Springer-Verlag, 2000, 317-331.
17. Harris, T., Marlow, S., Peyton Jones, S., Herlihy, M.: Composable memory transactions, Proc. of 10th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, PPoPP 2005 (Chicago, IL, June 2005), ACM Press, 2005, 48-60.
18. Hawblitzel, C.: Linear Types for Aliased Resources, Technical report MSR-TR-2005-2141, Microsoft Research, 2005.
19. Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs, Conf. Record of 30th SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2003 (New Orleans, LA, Jan. 2003), ACM Press, 2003, 185-197.
20. Hudak, P.: Building domain-specific embedded languages, ACM Computing Surveys, 28(4es), 1996, 196.
21. Igarashi, A., Kobayashi, N.: Type-based analysis of communication for concurrent programming languages, Proc. of 4th Int. Symposium on Static Analysis, SAS '97 (Paris, Sept. 1997) (P. Van Hentenryck, Ed.), Lect. Notes in Comput. Sci., 1302, Springer-Verlag, 1997, 187-201.
22. Igarashi, A., Kobayashi, N.: Resource usage analysis, Conf. Record of 29th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2002 (Portland, OR, Jan. 2002), ACM Press, 2002, 331-342.
23. Jin, N., He, J.: Towards a truly concurrent model for processes sharing resources, Proc. of 3rd IEEE Int. Conf. on Software Engingeering and Formal Methods, SEFM '05 (Koblenz, Sept. 2005), IEEE Computer Society Press, 2005, 231-239.
24. Kiselyov, O., Shan, C.-C.: Lightweight static resources: Sexy types for embedded and systems programming, Draft Proc. of 8th Symp. on Trends in Functional Programming, TFP '07 (New York, Apr. 2007), 2007.
25. Kobayashi, N.: A type system for lock-free processes, Information and Computation, 177(2), 2002, 122-159.
26. Kobayashi, N., Pierce, B. C., Turner, D. N.: Linearity and the pi-calculus, ACM Transactions on Programmming Languages and Systems, 21(5), 1999, 914-947.
27. Landin, P.: The next 700 programming languages, Communications of the ACM, 9(3), 1966, 157-166.
28. Leijen, D.: Parsec, a fast combinator parser, http://www.cs.uu.nl/~daan/ parsec.html, 2001.
29. Ligatti, J. A.: Policy Enforcement via Program Monitoring, PhD thesis, 2006.
30. Löh, A., McBride, C., Swierstra, W.: A tutorial implementation of a dependently typed lambda calculus, in this issue.
31. Marathe, V. J., Moir, M.: Efficient nonblocking software transactional memory, Proc. of 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '07 (San Jose, CA, March 2007), ACM Press, 2007, 136-137.
32. Marriott, K., Stuckey, P., Sulzmann, M.: Resource usage verification, Proc. of 1st Asian Symposium on Programming Languages and Systems, APLAS 2003 (Beijing, Nov. 2003) (A. Ohori, Ed.), Lect. Notes in Comput. Sci., 2895, Springer-Verlag, 2003, 212-229.
33. McBride, C.: Epigram: Practical programming with dependent types, Revised Lectures from 5th Int. School on Advanced Functional Programming, AFP 2004 (Tartu, Aug. 2004) (V. Vene, T. Uustalu, Eds.), Lect. Notes in Comput. Sci., 3622, Springer-Verlag, 2005, 130-170.
34. McBride, C., McKinna, J.: The view from the left, Journal of Functional Programming, 14(1), 2004, 69-111.
35. Nanevski, A., Govereau, P., Morrisett, G.: Towards type-theoretic semantics for transactional concurrency, Proc. of 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI '09 (Savannah, Jan. 2009), ACM Press, 2009, 79-90.
36. Nanevski, A., Morisett, G., Birkedal, L.: Polymorphism and separation in Hoare type theory, Proc. of 11th ACM SIGPLAN 2006 Int. Conf. on Functional Programming, ICFP 2006 (Portland, OR, Sept. 2006), ACM Press, 2006, 62-73.
37. Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., Birkedal, L.: Ynot: dependent types for imperative programs, Proc. of 13th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2008 (Victoria, BC, Sept. 2008), ACM Press, 2008, 229-240.
38. Oaks, S., Wong, H.: Java Threads, 3rd ed. O'Reilly, 2004.
39. Pašalíc, E., Taha,W., Sheard, T.: Tagless staged interpreters for typed languages, Proc. of 7th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2002 (Pittburgh, PA, Oct. 2002), ACM Press, 2002, 218-229.
40. Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs, Proc. of 11th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2006 (Portland, OR, Sept. 2006), ACM Press, 2006, 50-61.
41. Peyton Jones, S. L., Wadler, P.: Imperative functional programming, Conf. Record of 20th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, POPL '93 (Charleston, SC, Jan. 1993), ACM Press, 1993, 71-84.
42. Popeea, C., Chin, W.-N.: A type system for resource protocol verification and its correctness proof, Proc. of 2004 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '04 (Verona, Aug. 2004), ACM Press, 2004, 135-146.
43. Sheard, T.: Languages of the future, Companion to 19th Annual ACM SIGPLAN Conf. on Object Oriented Programming Systems, Languages and Applications, OOPSLA '04 (Vancouver, BC, Oct. 2004), ACM Press, 2004, 116-119.
44. Suenaga, K., Kobayashi, N.: Type-based analysis of deadlock for a concurrent calculus with interrupts, Proc. of 16th European Symposium on Programming, ESOP 2007 (Braga, March 2007) (R. de Nicola, Ed.), Lect. Notes in Comput. Sci., 4421, Springer-Verlag, 2007, 490-504.
45. Sutter, H.: Use lock hierarchies to avoid deadlock, Dr Dobb's Journal, 33(1), 2008.
46. Taha, W.: Multi-Stage Programming: Its Theory and Applications, PhD thesis, Oregon Graduate Inst. of Science and Technology, 1999.
47. Turner, D. A.: Elementary strong functional programming, Proc. of 1st Int. Symposium on Functional Programming Languages in Education, FLPE '95 (Nijmegen, Dec. 1995) (P. Hartel, R. Plasmeijer, Eds.), Lect. Notes in Comput. Sci., 1022, Springer-Verlag, 1995, 1-13.
48. Walker, D.: A Type system for expressive security policies, Proc. of 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2000 (Boston, MA, Jan. 2000), ACM Press, 2000, 254-267.
49. Abel, A., Altenkirch, T.: A Partial Type Checking Algorithm for Type:Type, International Workshop on Mathematically Structured Functional Programming (V. Capretta, C. McBride, Eds.), 2008.
50. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions, Springer Verlag, 2004.
51. Coquand, T.: An analysis of Girard's paradox, First IEEE Symposium on Logic in Computer Science, 1986.
52. Coquand, T.: An Algorithm for Type-Checking Dependent Types, Science of Computer Programming, 26(1- 3), 1996, 167-177.
53. Coquand, T., Takeyama, M.: An Implementation of Type: Type, International Workshop on Types for Proofs and Programs, 2000.
54. Hinze, R., Löh, A.: lhs2TEX, 2007, http://www.cs.uu.nl/-andres/ lhs2tex.
55. λΠ homepage, 2007, http://www.cs.uu.nl/-andres/LambdaPi.
56. Martin-Löf, P.: Intuitionistic type theory, Bibliopolis, 1984.
57. McBride, C.: Dependently Typed Functional Programs and their Proofs, Ph.D. Thesis, University of Edinburgh, 1999.
58. McBride, C.: Elimination with a Motive, TYPES '00: Selected papers from the International Workshop on Types for Proofs and Programs, Springer-Verlag, 2000.
59. McBride, C.: Faking it: Simulating Dependent Types in Haskell, Journal of Functional Programming, 12(5), 2002, 375-392.
60. McBride, C.: Epigram: Practical Programming with Dependent Types., Advanced Functional Programming, 2004.
61. McBride, C., McKinna, J.: Functional pearl: I am not a number - I am a free variable, Haskell '04: Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, 2004.
62. McBride, C., McKinna, J.: The view from the left, Journal of Functional Programming, 14(1), 2004, 69-111.
63. McBride, C. et al.: Epigram, 2004, http://www.e-pig.org.
64. Meijer, E., Fokkinga, M., Paterson, R.: Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, 5th Conf. on Functional Programming Languages and Computer Architecture, 1991.
65. Nordström, B., Petersson, K., Smith, J. M.: Programming in Martin-Löf's Type Theory: An Introduction, Clarendon, 1990.
66. Norell, U.: Agda 2, http://appserv.cs.chalmers.se/users/ulfn/wiki/agda. php.
67. Norell, U.: Towards a practical programming language based on dependent type theory, Ph.D. Thesis, Chalmers University of Technology, 2007.
68. Norell, U., Coquand, C.: Type checking in the presence of meta-variables, Submitted to Typed Lambda Calculi and Applications 2007.
69. Pierce, B. C.: Types and Programming Languages, MIT Press, Cambridge, MA, USA, 2002, ISBN 0-262- 16209-16211
70. Pierce, B. C., Turner, D. N.: Local Type Inference, ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), San Diego, California, 1998, Full version in ACM Transactions on Programming Languages and Systems (TOPLAS), 22(1), January 2000, pp. 1-44.
71. Pollack, R.: Closure under alpha-conversion, TYPES '93: Proceedings of the international workshop on Types for proofs and programs, 1994.
72. Thompson, S.: Type Theory and Functional Programming, Addison Wesley Longman Publishing Co., Inc., 1991.
73. Adams, A. A., Dennis, L. A.: Rippling in PVS, Proc. of 1st Int. Workshop on Design and Application of Strategies/Tactics in Higher Order Logics, STRATA 2003 (M. Archer, B. Di Vito, C. Muñoz, Eds.), Technical report CP-2003-212448, NASA, 2003, 84-90.
74. Aderhold, M.: Improvements in formula generalization., Proc. of 21st Int. Conf. on Automated Deduction, CADE-21 (Bremen, July 2007) (F. Pfenning, Ed.), Lect. Notes in Artif. Intell., 4603, Springer-Verlag, 2007, 231-246.
75. Aubin, R.: Mechanizing Structural Induction, PhD thesis, University of Edinburgh, 1976.
76. Augustsson, L.: Cayenne-a language with dependent types, Proc. of 3rd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '98 (Baltimore, MD, Sept. 1998), ACM Press, 1998, 239-250.
77. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions, Texts in Theoretical Computer Science, Springer-Verlag, 2004.
78. Boyer, R. S., Moore, J. S.: A Computational Logic, Academic Press, 1979.
79. Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-Level Guidance for Mathematical Reasoning, Cambridge University Press, 2005.
80. Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system, Proc. of 10th Int. Conf. on Automated Deduction, CADE-10 (Kaiserslautern, July 1990) (M. Stickel, Ed.), Lect. Notes in Artif. Intell., 449, Springer-Verlag, 1990, 647-648.
81. Burton, F. W.: An efficient functional implementation of FIFO queues, Information Processing Letters, 14(5), 1982, 205-206.
82. Claessen, K., Hughes, J.: QuickCheck: A lightweight tool for random testing of Haskell programs, Proc. of 5th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '00, Montréal, Sept. 2000), ACM Press, 2000, 268-279.
83. Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., Sasaki, J. T., Smith, S. F.: Implementing Mathematics with the Nuprl Development System, Prentice-Hall, 1986.
84. Coquand, C.: The AGDA proof system homepage, 1998, http://www.cs. chalmers.se/̃catarina/ agda/.
85. Cui, S., Donnelly, K., Xi, H.: ATS: A language that combines programming with theorem proving, Proc. of 5th Int. Workshop on Frontiers of Combining Systems, FroCoS 2005 (Vienna, Sept. 2005) (B. Gramlich, Ed.), Lect. Notes in Artif. Intell., 3717, Springer-Verlag, 2005, 310-320.
86. Delahaye, D.: A tactic language for the system Coq, Proc. of 7th Int. Conf. on Logic for Programming and Automated Reasoning, LPAR 2000 (Reunion Island, Nov. 2000) (M. Parigot, A. Voronkov, Eds.), Lect. Notes in Artif. Intell., 1955, Springer-Verlag, 2000, 85-95.
87. Dennis, L. A., Green, I., Smaill, A.: Embeddings as a higher-order representation of annotations for rippling, Technical report NOTTCS-WP-2005-2011, School of CS and IT, University of Nottingham, 2005.
88. Dixon, L.: A Proof Planning Framework for Isabelle, PhD thesis, University of Edinburgh, 2005.
89. Gronski, J., Knowles, K., Tomb, A., Freund, S. N., Flanagan, C.: Sage: hybrid checking for flexible specifications, Proc. of 7th ACM SIGPLAN Scheme and Functional Programming Workshop, Scheme 2006 (Portland, OR, Sept. 2006) (R. Findler, Ed.), Technical report TR2006-06, Dept. of Computer Science, University of Chicago, 2006, 93-104.
90. Ireland, A., Bundy, A.: Productive use of failure in inductive proof, Journal of Automated Reasoning, 16(1- 2), 1996, 79-111.
91. Kammüller, F.: Modular reasoning in Isabelle, Proc. of 17th Int. Conf. on Automated Deduction, CADE-17 (Pittsburgh, PA, June 2000) (D. A. McAllester, Ed.), Lect. Notes in Artif. Intell., 1831, Springer-Verlag, 2000, 99-114.
92. Martin-Löf, P.: A theory of types, Manuscript, 1971.
93. The Coq development team: The Coq Proof Assistant Reference Manual, version 8.1. LogiCal Project, 2006
94. McBride, C., McKinna, J.: The view from the left, Journal of Functional Programing, 14(1), 2004, 69-111.
95. Nipkow, T., Paulson, L. C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic, Lect. Notes in Comput. Sci., 2283, Springer-Verlag, 2002.
96. Owre, S., Shankar, N., Rushby, J. M., Stringer-Calvert, D. W.: PVS System Guide, Computer Science Laboratory, SRI International, Menlo Park, CA, 1999.
97. Pientka, B., Kreitz, C.: Instantiation of existentially quantified variables in inductive specification proofs, Proc. of Int. Conf. on Artificial Intelligence and Symbolic Computation, AISC' 98 (Plattsburgh, NY, Sept. 1998) (J. Calmet, J. A. Plaza, Eds.), Lect. Notes in Comput. Sci., 1476, Springer-Verlag, 1998, 247-258.
98. Smaill, A., Green, I.: Higher-order annotated terms for proof search, Proc. of 9th Int. Conf. on Theorem Proving in Higher Order Logics, TPHOLs '96 (Turku, Aug. 1996) (J. von Wright, J. Grundy, J. Harrison, Eds.), Lect. Notes in Comput. Sci., 1125, Springer-Verlag, 1996, 399-413.
99. Sozeau, M.: Program-ing finger trees in Coq, Proc. of 12th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '07 (Freiburg, Oct. 2007), ACM Press, 2007, 13-24.
100. Sozeau, M.: Subset coercions in Coq, Revised Selected Papers from Int. Workshop on Types for Proofs and Program TYPES 2006 (Nottingham, Apr. 2006) (T. Altenkirch, C. McBride, Eds.), Lect. Notes in Comput. Sci., 4502, Springer-Verlag, 2007, 237-252.
101. Werner, B.: Méta-théorie du Calcul des Constructions Inductives, PhD Thesis, Université Paris 7, 1994.
102. Xi, H., Pfenning, F.: Dependent types in practical programming, Proc. of 26th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '99 (San Antonio, TX, Jan. 1999), ACM Press, 1999, 214-227.