Nominal Sets in Agda - A Fresh and Immature Mechanization (Q6118749): Difference between revisions

@@ Property / cites work @@
+Q2871861
@@ Property / cites work: Q2871861 / rank @@
+Normal rank
@@ Property / cites work @@
+Formalising the pi-calculus using nominal logic
@@ Property / cites work: Formalising the pi-calculus using nominal logic / rank @@
+Normal rank
@@ Property / cites work @@
+Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory
+Normal rank
@@ Property / cites work @@
+Alpha-structural induction and recursion for the lambda calculus in constructive type theory
+Normal rank
@@ Property / cites work @@
+Q3062067
@@ Property / cites work: Q3062067 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to abstract syntax with variable binding
+Normal rank
@@ Property / cites work @@
+Q4044675
@@ Property / cites work: Q4044675 / rank @@
+Normal rank
@@ Property / cites work @@
+Nominal Sets
@@ Property / cites work: Nominal Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
+Normal rank