IDRIS - Systems programming meets full dependent types

PLPV'11 - Proceedings of the 5th ACM Workshop on Programming Languages Meets Program Verification

Volumn , Issue , 2011, Pages 43-54

  Brady, Edwin C ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Data description; Dependent types

Indexed keywords

APPLICATION DEVELOPERS; BINARY FILES; BIT LEVEL; BURDEN OF PROOF; DECISION PROCEDURE; DEPENDENT TYPES; DISTINCTIVE FEATURES; EXECUTABLE CODES; EXTERNAL SYSTEMS; HIGH LEVEL OF ABSTRACTION; LOW-LEVEL SYSTEMS; NETWORK PACKETS; OPERATING SYSTEMS; PLUG-INS; PROGRAM CORRECTNESS; PROGRAM VERIFICATION; PROGRAMMING LANGUAGE; TYPE SYSTEMS;

COMPUTER OPERATING SYSTEMS; COMPUTER SYSTEMS PROGRAMMING; DATA DESCRIPTION; EMBEDDED SYSTEMS; PACKET NETWORKS;

HIGH LEVEL LANGUAGES;

EID: 79952139039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1929529.1929536     Document Type: Conference Paper

References (36)

1. S. Bhatti, E. Brady, K. Hammond, and J. McKinna. Domain specific languages (DSLs) for network protocols. In International Workshop on Next Generation Network Architecture (NGNA 2009), 2009.
2. H.-J. Boehm, A. J. Demers, Xerox Corporation Silicon Graphic, and Hewlett-Packard Company. A garbage collector for C and C++, 2001.
3. E. Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
4. E. Brady. Ivor, a proof engine. In Implementation and Application of Functional Languages 2006, LNCS. Springer-Verlag, 2007.
5. E. Brady and K. Hammond. Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation. In ICFP '10: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, pages 297-308, New York, NY, USA, 2010. ACM.
6. E. Brady, C. McBride, and J. McKinna. Inductive families need not store their indices. In S. Berardi, M. Coppo, and F. Damiani, editors, Types for Proofs and Programs 2003, volume 3085 of Lecture Notes in Computer Science, pages 115-129. Springer, 2004.
7. J. Chapman, P.-E. Dagand, C. McBride, and P. Morris. The gentle art of levitation. In ICFP '10: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, pages 3-14, New York, NY, USA, 2010. ACM.
8. Coq Development Team. The Coq proof assistant - reference manual. http://coq.inria.fr/, 2009.
9. N. A. Danielsson. Total parser combinators. In ICFP '10: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, pages 285-296, New York, NY, USA, 2010. ACM.
10. P. Dybjer and A. Setzer. A finite axiomatization of inductive-recursive definitions. In Tyed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 129-146. Springer, 1998.
11. K. Fisher, Y. Mandelbaum, and D. Walker. The next 700 data description languages. SIGPLAN Not., 41(1):2-15, 2006.
12. K. Hammond and G. Michaelson. Hume: a Domain-Specific Language for Real-Time Embedded Systems. In Proc. Conf. Generative Programming and Component Engineering (GPCE '03), Lecture Notes in Computer Science. Springer-Verlag, 2003.
13. P. Hancock and A. Setzer. Interactive programs in dependent type theory. In P. Clote and H. Schwichtenberg, editors, Proc. of 14th Ann. Conf. of EACSL, CSL'00, Fischbau, Germany, 21-26 Aug 2000, volume 1862, pages 317-331. Springer-Verlag, Berlin, 2000.
14. P. Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28A(4), December 1996.
15. D. Leijen. Parsec, a fast combinator parser. http://www.cs.uu.nl/~daan/ parsec.html, 2001.
16. X. Leroy. Formal certification of a compiler back-end. In Principles of Programming Languages 2006, pages 42-54. ACM Press, 2006.
17. P. Letouzey. A new extraction for Coq. In H. Geuvers and F. Wiedijk, editors, Types for proofs and programs, LNCS. Springer, 2002.
18. A. Madhavapeddy, A. Ho, T. Deegan, D. Scott, and R. Sohan. Melange: creating a "functional" internet. In EuroSys '07: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007, New York, NY, USA, 2007. ACM.
19. Y. Mandelbaum, K. Fisher, D. Walker, M. F. Fernández, and A. Gleyzer. PADS/ML: a functional data description language. In M. Hofmann and M. Felleisen, editors, POPL '07: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007, pages 77-83. ACM, 2007.
20. C. McBride. Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation. In WGP '10: Proceedings of the 6th ACM SIGPLAN workshop on Generic programming, pages 1-12, New York, NY, USA, 2010. ACM.
21. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004. (Pubitemid 38172187)
22. P. J. McCann and S. Chandra. Packet types: Abstract specification of network protocol messages. In SIGCOMM '00. ACM, 2000.
23. F. Mérillon, L. Réveillère, C. Consel, R. Marlet, and G. Muller. Devil: An idl for hardware programming. In 4th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2000), 2000.
24. J. Morgenstern and D. R. Licata. Security-typed programming within dependently typed programming. In ICFP '10: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, pages 169-180, New York, NY, USA, 2010. ACM.
25. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, September 2007.
26. N. Oury and W. Swierstra. The power of Pi. In J. Hook and P. Thie-mann, editors, ICFP '08: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pages 39-50. ACM, 2008.
27. C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. PhD thesis, Paris 7, 1989.
28. S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proc. 2006 International Conf. on Functional Programming (ICFP 2006), 2006.
29. J. Postel. Internet Control Message Protocol. RFC 792 (Standard), Sept. 1981. Updated by RFCs 950, 4884.
30. J. Postel. Internet Protocol. RFC 791 (Standard), Sept. 1981. Updated by RFC 1349.
31. W. Pugh. The Omega Test: a fast and practical integer programming algorithm for dependence analysis. Communication of the ACM, pages 102-114, 1992.
32. M. Sozeau. Equations: A dependent pattern-matching compiler. In First International Conference on Interactive Theorem Proving (ITP 2010), pages 419-434, 2010.
33. M. Sozeau and N. Oury. First-class type classes. In TPHOLs '08: Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, pages 278-293, Berlin, Heidelberg, 2008. Springer-Verlag.
34. E. van der Weegen and J. McKinna. A machine-checked proof of the average-case complexity of quicksort in coq. Lecture Notes in Computer Science, pages 256-271. Springer, 2009.
35. D. Williams, P. Reynolds, K. Walsh, E. G. Sirer, and F. B. Schneider. Device driver safety through a reference validation mechanism. In 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008), 2008.
36. H. Xi. Applied Type System (extended abstract). In S. Berardi, M. Coppo, and F. Damiani, editors, Types for Proofs and Programs 2003, volume 3085 of Lecture Notes in Computer Science, pages 394-408. Springer, 2004.