The Isabelle collections framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6172 LNCS, Issue , 2010, Pages 339-354

  Lammich, Peter ^a   Lochbihler, Andreas ^b  

^a UNIVERSITY OF MÜNSTER   (Germany)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASS; CORRECTNESS PROOFS; DATA REFINEMENTS; FUNCTIONAL CODES; HASKELL; ISABELLE; ISABELLE/HOL FORMALIZATION; LINEAR TIME; TREE AUTOMATA; UNIFIED FRAMEWORK;

DATA STRUCTURES; PROBLEM SOLVING; TRANSLATION (LANGUAGES);

THEOREM PROVING;

EID: 77955232763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_24     Document Type: Conference Paper

References (18)

1. Ballarin, C.: Interpretation of locales in Isabelle: Theories and proof contexts. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol. 4108, pp. 31-43. Springer, Heidelberg (2006)
2. Berghofer, S., Reiter, M.: Formalizing the logic-automaton connection. In: TPHOLs '09, pp. 147-163. Springer, Heidelberg (2009)
3. Bulwahn, L., Krauss, A., Haftmann, F., Erkök, L., Matthews, J.: Imperative functional programming with Isabelle/HOL. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 134-149. Springer, Heidelberg (2008)
4. The Coq standard library, http://coq.inria.fr/stdlib/index.html
5. de Dios, J., Peña, R.: Formal certification of a resource-aware language implementation. In: TPHOLs '09, pp. 196-211. Springer, Heidelberg (2009)
6. Genet, T., Tong, V.V.T.: Timbuk 2.2., http://www.irisa.fr/celtique/genet/ timbuk/
7. Haftmann, F., Nipkow, T.: Code generation via higher-order rewrite systems. In: Functional and Logic Programming (FLOPS 2010). LNCS. Springer, Heidelberg (2010)
8. Hardy, G.H., Ramanujan, S.: The normal number of prime factors of a number. Quart. J. of Math. 48, 76-92 (1917)
9. Java: The collections framework, http://java.sun.com/javase/6/docs/ technotes/guides/collections/
10. Kaufmann, M., Moore, J.S.: An industrial strength theorem prover for a logic based on common lisp. IEEE Transactions on Software Engineering 23, 203-213 (1997)
11. Kuncak, V.: Binary search trees. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs. Formal proof development (2004), http://afp.sf.net/entries/BinarySearchTree.shtml
12. Lammich, P.: Isabelle collection library. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs. Formal proof development (2009), http://afp.sf.net/entries/collections.shtml
13. Lammich, P.: Tree automata. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs. Formal proof development (2009), http://afp.sf.net/entries/Tree-Automata.shtml
14. LETHAL tree and hedge automata library, http://lethal.sourceforge.net/
15. Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.): Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
16. Nipkow, T., Pusch, C.: AVL trees. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs. Formal proof development (2004), http://afp.sf.net/entries/AVL-Trees.shtml
17. Peyton Jones, S.: Bulk types with class. In: FPW '96 (1996)
18. Stepanov, A., Lee, M.: The standard template library. Technical Report 95-11(R.1), HP Laboratories (1995)