简体   繁体   English

您如何使用 agda-stdlib 对用户定义的方程式关系进行方程式推理?

[英]How do you do equational reasoning for user defined equational relations with agda-stdlib?

agda-stdlib has facilities for doing equational reasoning for various specific library defined relations ( example ). agda-stdlib 具有为各种特定库定义的关系( 示例)进行等式推理的工具。 It also has a type that identifies equality relations defined here .它还有一个类型,用于标识此处定义的相等关系。 What is the easiest way for me to get access to the same facilities for equational reason I get with propositional equality.出于等式原因,我通过命题平等获得相同设施的最简单方法是什么。

The kit is defined in Relation.Binary.Reasoning.Setoid .该工具包在Relation.Binary.Reasoning.Setoid中定义。

You only need to define a proof S that your relation defines a Setoid and then you can open import Relation.Binary.Reasoning.Setoid S to get the equational reasoning combinators.您只需要定义一个证明S ,证明您的关系定义了一个Setoid ,然后您可以open import Relation.Binary.Reasoning.Setoid S来获取等式推理组合器。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM