From 01ec93c5a03f6c4c660aa593b4c00afccc48907a Mon Sep 17 00:00:00 2001
From: Chloe Brown <chloe.brown.00@outlook.com>
Date: Mon, 8 Feb 2021 17:40:04 +0000
Subject: Make languages records with more properties.

---
 src/Cfe/Language/Properties.agda | 28 ++++++++++++++++++++++++----
 1 file changed, 24 insertions(+), 4 deletions(-)

(limited to 'src/Cfe/Language/Properties.agda')

diff --git a/src/Cfe/Language/Properties.agda b/src/Cfe/Language/Properties.agda
index 8d024a8..52d4644 100644
--- a/src/Cfe/Language/Properties.agda
+++ b/src/Cfe/Language/Properties.agda
@@ -3,19 +3,39 @@
 open import Relation.Binary
 
 module Cfe.Language.Properties
-  {a ℓ} (setoid : Setoid a ℓ)
+  {c ℓ} {setoid : Setoid c ℓ}
   where
 
 open Setoid setoid renaming (Carrier to A)
-
 open import Cfe.Language setoid
+open Language
+
+open import Data.List
+open import Data.List.Relation.Binary.Equality.Setoid setoid
 open import Function
+open import Level
+open import Relation.Binary.Construct.InducedPoset
+
+_≤′_ : ∀ {a aℓ} → Rel (Language a aℓ) (c ⊔ a)
+_≤′_ = _≤_
 
 ------------------------------------------------------------------------
 -- Properties of _≤_
 
-≤-refl : Reflexive _≤_
+≤-refl : ∀ {a aℓ} → Reflexive (_≤′_ {a} {aℓ})
 ≤-refl = id
 
-≤-trans : Transitive _≤_
+≤-trans : ∀ {a b c aℓ bℓ cℓ} → Trans (_≤_ {a} {aℓ}) (_≤_ {b} {bℓ} {c} {cℓ}) _≤_
 ≤-trans A≤B B≤C = B≤C ∘ A≤B
+
+≤-poset : ∀ {a aℓ} → Poset (c ⊔ ℓ ⊔ suc (a ⊔ aℓ)) (c ⊔ a) (c ⊔ a)
+≤-poset {a} {aℓ} = InducedPoset (_≤′_ {a} {aℓ}) id (λ i≤j j≤k → j≤k ∘ i≤j)
+
+-- ------------------------------------------------------------------------
+-- -- Properties of _∪_
+
+-- ∪-cong-≤ : Congruent₂ _≤_ _∪_
+-- ∪-cong-≤ A≤B C≤D = map A≤B C≤D
+
+-- ∪-cong : Congruent₂ _≈_ _∪_
+-- ∪-cong {A} {B} {C} {D} = ≤-cong₂→≈-cong₂ {_∪_} (λ A≤B C≤D → map A≤B C≤D) {A} {B} {C} {D}
-- 
cgit v1.2.3