Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL (Q3183537): Difference between revisions

@@ Property / cites work @@
+Q4945200
@@ Property / cites work: Q4945200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736387
@@ Property / cites work: Q4736387 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024867
@@ Property / cites work: Q3024867 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive Type Classes in Isabelle
@@ Property / cites work: Constructive Type Classes in Isabelle / rank @@
+Normal rank
@@ Property / cites work @@
+Partial Recursive Functions in Higher-Order Logic
@@ Property / cites work: Partial Recursive Functions in Higher-Order Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Theorem Proving in Higher Order Logics
@@ Property / cites work: Theorem Proving in Higher Order Logics / rank @@
+Normal rank
@@ Property / cites work @@
+Nominal techniques in Isabelle/HOL
@@ Property / cites work: Nominal techniques in Isabelle/HOL / rank @@
+Normal rank
@@ Property / cites work @@
+A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
+Normal rank